/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:42:08,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:42:08,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:42:08,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:42:08,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:42:08,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:42:08,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:42:08,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:42:08,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:42:08,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:42:08,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:42:08,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:42:08,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:42:08,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:42:08,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:42:08,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:42:08,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:42:08,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:42:08,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:42:08,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:42:08,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:42:08,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:42:08,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:42:08,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:42:08,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:42:08,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:42:08,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:42:08,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:42:08,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:42:08,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:42:08,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:42:08,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:42:08,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:42:08,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:42:08,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:42:08,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:42:08,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:42:08,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:42:08,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:42:08,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:42:08,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:42:08,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:42:08,217 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:42:08,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:42:08,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:42:08,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:42:08,223 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:42:08,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:42:08,223 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:42:08,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:42:08,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:42:08,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:42:08,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:42:08,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:42:08,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:42:08,224 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:42:08,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:42:08,227 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:42:08,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:42:08,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:42:08,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:42:08,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:42:08,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:42:08,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:42:08,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:42:08,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:42:08,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:42:08,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:42:08,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:42:08,229 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:42:08,229 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:42:08,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:42:08,231 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:42:08,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:42:08,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:42:08,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:42:08,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:42:08,536 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:42:08,536 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:42:08,537 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i [2019-12-27 22:42:08,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caaab69e4/286bf360272c4495aefac01e5dfa5e5f/FLAG8730409fb [2019-12-27 22:42:09,156 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:42:09,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i [2019-12-27 22:42:09,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caaab69e4/286bf360272c4495aefac01e5dfa5e5f/FLAG8730409fb [2019-12-27 22:42:09,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caaab69e4/286bf360272c4495aefac01e5dfa5e5f [2019-12-27 22:42:09,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:42:09,463 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:42:09,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:42:09,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:42:09,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:42:09,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:42:09" (1/1) ... [2019-12-27 22:42:09,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09, skipping insertion in model container [2019-12-27 22:42:09,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:42:09" (1/1) ... [2019-12-27 22:42:09,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:42:09,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:42:10,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:42:10,119 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:42:10,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:42:10,272 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:42:10,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10 WrapperNode [2019-12-27 22:42:10,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:42:10,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:42:10,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:42:10,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:42:10,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10" (1/1) ... [2019-12-27 22:42:10,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10" (1/1) ... [2019-12-27 22:42:10,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:42:10,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:42:10,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:42:10,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:42:10,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10" (1/1) ... [2019-12-27 22:42:10,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10" (1/1) ... [2019-12-27 22:42:10,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10" (1/1) ... [2019-12-27 22:42:10,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10" (1/1) ... [2019-12-27 22:42:10,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10" (1/1) ... [2019-12-27 22:42:10,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10" (1/1) ... [2019-12-27 22:42:10,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10" (1/1) ... [2019-12-27 22:42:10,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:42:10,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:42:10,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:42:10,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:42:10,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:42:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:42:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:42:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:42:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:42:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:42:10,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:42:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:42:10,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:42:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:42:10,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:42:10,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:42:10,497 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:42:11,199 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:42:11,199 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:42:11,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:42:11 BoogieIcfgContainer [2019-12-27 22:42:11,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:42:11,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:42:11,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:42:11,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:42:11,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:42:09" (1/3) ... [2019-12-27 22:42:11,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7997594a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:42:11, skipping insertion in model container [2019-12-27 22:42:11,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:10" (2/3) ... [2019-12-27 22:42:11,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7997594a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:42:11, skipping insertion in model container [2019-12-27 22:42:11,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:42:11" (3/3) ... [2019-12-27 22:42:11,216 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.opt.i [2019-12-27 22:42:11,230 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:42:11,230 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:42:11,242 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:42:11,243 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:42:11,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,311 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,312 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,345 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,345 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,346 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:11,393 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 22:42:11,416 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:42:11,416 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:42:11,416 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:42:11,416 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:42:11,416 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:42:11,417 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:42:11,417 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:42:11,417 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:42:11,441 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 22:42:11,443 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 22:42:11,539 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 22:42:11,539 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:42:11,558 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:42:11,575 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 22:42:11,663 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 22:42:11,663 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:42:11,673 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:42:11,687 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 22:42:11,688 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:42:15,115 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 22:42:15,218 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 22:42:15,247 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-27 22:42:15,247 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 22:42:15,250 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 22:42:15,674 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 22:42:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 22:42:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:42:15,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:15,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:42:15,684 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:15,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-27 22:42:15,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:15,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969597209] [2019-12-27 22:42:15,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:15,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969597209] [2019-12-27 22:42:15,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:15,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:42:15,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [397149991] [2019-12-27 22:42:15,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:15,962 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:16,016 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:42:16,016 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:16,020 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:16,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:16,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:16,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:16,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:16,039 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 22:42:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:16,322 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-27 22:42:16,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:16,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:42:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:16,412 INFO L225 Difference]: With dead ends: 7864 [2019-12-27 22:42:16,413 INFO L226 Difference]: Without dead ends: 7408 [2019-12-27 22:42:16,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-27 22:42:16,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-27 22:42:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-27 22:42:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-27 22:42:16,800 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-27 22:42:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:16,801 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-27 22:42:16,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-27 22:42:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:42:16,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:16,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:16,805 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:16,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:16,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-27 22:42:16,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:16,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100228936] [2019-12-27 22:42:16,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:16,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100228936] [2019-12-27 22:42:16,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:16,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:42:16,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2083328972] [2019-12-27 22:42:16,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:16,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:16,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:42:16,934 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:16,934 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:16,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:42:16,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:16,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:42:16,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:42:16,936 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-27 22:42:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:17,383 INFO L93 Difference]: Finished difference Result 11318 states and 34916 transitions. [2019-12-27 22:42:17,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:42:17,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:42:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:17,456 INFO L225 Difference]: With dead ends: 11318 [2019-12-27 22:42:17,456 INFO L226 Difference]: Without dead ends: 11311 [2019-12-27 22:42:17,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:42:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11311 states. [2019-12-27 22:42:17,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11311 to 10103. [2019-12-27 22:42:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-12-27 22:42:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 31738 transitions. [2019-12-27 22:42:17,843 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 31738 transitions. Word has length 11 [2019-12-27 22:42:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:17,843 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 31738 transitions. [2019-12-27 22:42:17,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:42:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 31738 transitions. [2019-12-27 22:42:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:42:17,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:17,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:17,849 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-27 22:42:17,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:17,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972504708] [2019-12-27 22:42:17,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:17,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972504708] [2019-12-27 22:42:17,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:17,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:42:17,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1023025553] [2019-12-27 22:42:17,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:17,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:17,958 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 22:42:17,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:17,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:17,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:42:17,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:17,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:42:17,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:42:17,960 INFO L87 Difference]: Start difference. First operand 10103 states and 31738 transitions. Second operand 5 states. [2019-12-27 22:42:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:18,441 INFO L93 Difference]: Finished difference Result 14191 states and 43941 transitions. [2019-12-27 22:42:18,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:42:18,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:42:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:18,489 INFO L225 Difference]: With dead ends: 14191 [2019-12-27 22:42:18,489 INFO L226 Difference]: Without dead ends: 14191 [2019-12-27 22:42:18,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:42:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2019-12-27 22:42:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11080. [2019-12-27 22:42:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-12-27 22:42:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 34779 transitions. [2019-12-27 22:42:18,871 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 34779 transitions. Word has length 14 [2019-12-27 22:42:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:18,872 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 34779 transitions. [2019-12-27 22:42:18,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:42:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 34779 transitions. [2019-12-27 22:42:18,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 22:42:18,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:18,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:18,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:18,877 INFO L82 PathProgramCache]: Analyzing trace with hash -827168568, now seen corresponding path program 1 times [2019-12-27 22:42:18,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:18,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217053739] [2019-12-27 22:42:18,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:18,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217053739] [2019-12-27 22:42:18,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:18,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:42:18,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1659699721] [2019-12-27 22:42:18,963 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:18,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:18,969 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 22:42:18,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:18,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:18,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:18,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:18,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:18,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:18,974 INFO L87 Difference]: Start difference. First operand 11080 states and 34779 transitions. Second operand 3 states. [2019-12-27 22:42:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:19,035 INFO L93 Difference]: Finished difference Result 11055 states and 34705 transitions. [2019-12-27 22:42:19,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:19,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 22:42:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:19,069 INFO L225 Difference]: With dead ends: 11055 [2019-12-27 22:42:19,070 INFO L226 Difference]: Without dead ends: 11055 [2019-12-27 22:42:19,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11055 states. [2019-12-27 22:42:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11055 to 11055. [2019-12-27 22:42:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11055 states. [2019-12-27 22:42:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11055 states to 11055 states and 34705 transitions. [2019-12-27 22:42:19,985 INFO L78 Accepts]: Start accepts. Automaton has 11055 states and 34705 transitions. Word has length 16 [2019-12-27 22:42:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:19,985 INFO L462 AbstractCegarLoop]: Abstraction has 11055 states and 34705 transitions. [2019-12-27 22:42:19,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 11055 states and 34705 transitions. [2019-12-27 22:42:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 22:42:19,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:19,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:19,990 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:19,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:19,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1227333524, now seen corresponding path program 1 times [2019-12-27 22:42:19,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:19,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287495283] [2019-12-27 22:42:19,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:20,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287495283] [2019-12-27 22:42:20,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:20,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:42:20,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [692780441] [2019-12-27 22:42:20,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:20,047 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:20,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 22:42:20,051 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:20,070 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:42:20,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:42:20,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:20,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:42:20,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:42:20,071 INFO L87 Difference]: Start difference. First operand 11055 states and 34705 transitions. Second operand 4 states. [2019-12-27 22:42:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:20,177 INFO L93 Difference]: Finished difference Result 18070 states and 56990 transitions. [2019-12-27 22:42:20,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:42:20,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 22:42:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:20,205 INFO L225 Difference]: With dead ends: 18070 [2019-12-27 22:42:20,205 INFO L226 Difference]: Without dead ends: 8920 [2019-12-27 22:42:20,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:42:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8920 states. [2019-12-27 22:42:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8920 to 8920. [2019-12-27 22:42:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8920 states. [2019-12-27 22:42:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8920 states to 8920 states and 27520 transitions. [2019-12-27 22:42:20,622 INFO L78 Accepts]: Start accepts. Automaton has 8920 states and 27520 transitions. Word has length 17 [2019-12-27 22:42:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:20,622 INFO L462 AbstractCegarLoop]: Abstraction has 8920 states and 27520 transitions. [2019-12-27 22:42:20,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:42:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8920 states and 27520 transitions. [2019-12-27 22:42:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 22:42:20,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:20,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:20,627 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:20,627 INFO L82 PathProgramCache]: Analyzing trace with hash -340030964, now seen corresponding path program 1 times [2019-12-27 22:42:20,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:20,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717811142] [2019-12-27 22:42:20,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:20,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717811142] [2019-12-27 22:42:20,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:20,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:42:20,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [861802333] [2019-12-27 22:42:20,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:20,693 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:20,696 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 22:42:20,697 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:20,697 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:20,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:20,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:20,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:20,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:20,698 INFO L87 Difference]: Start difference. First operand 8920 states and 27520 transitions. Second operand 3 states. [2019-12-27 22:42:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:20,742 INFO L93 Difference]: Finished difference Result 8487 states and 25699 transitions. [2019-12-27 22:42:20,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:20,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 22:42:20,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:20,762 INFO L225 Difference]: With dead ends: 8487 [2019-12-27 22:42:20,762 INFO L226 Difference]: Without dead ends: 8487 [2019-12-27 22:42:20,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-12-27 22:42:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 8487. [2019-12-27 22:42:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8487 states. [2019-12-27 22:42:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8487 states to 8487 states and 25699 transitions. [2019-12-27 22:42:20,998 INFO L78 Accepts]: Start accepts. Automaton has 8487 states and 25699 transitions. Word has length 18 [2019-12-27 22:42:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:20,998 INFO L462 AbstractCegarLoop]: Abstraction has 8487 states and 25699 transitions. [2019-12-27 22:42:20,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 8487 states and 25699 transitions. [2019-12-27 22:42:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:42:21,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:21,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:21,002 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:21,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1311287021, now seen corresponding path program 1 times [2019-12-27 22:42:21,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:21,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365842233] [2019-12-27 22:42:21,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:21,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365842233] [2019-12-27 22:42:21,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:21,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:42:21,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1314115745] [2019-12-27 22:42:21,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:21,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:21,080 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 25 transitions. [2019-12-27 22:42:21,080 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:21,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:42:21,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:42:21,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:21,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:42:21,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:42:21,085 INFO L87 Difference]: Start difference. First operand 8487 states and 25699 transitions. Second operand 4 states. [2019-12-27 22:42:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:21,117 INFO L93 Difference]: Finished difference Result 1553 states and 3753 transitions. [2019-12-27 22:42:21,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:42:21,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 22:42:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:21,120 INFO L225 Difference]: With dead ends: 1553 [2019-12-27 22:42:21,120 INFO L226 Difference]: Without dead ends: 1134 [2019-12-27 22:42:21,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:42:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2019-12-27 22:42:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1134. [2019-12-27 22:42:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-12-27 22:42:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 2445 transitions. [2019-12-27 22:42:21,140 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 2445 transitions. Word has length 19 [2019-12-27 22:42:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:21,140 INFO L462 AbstractCegarLoop]: Abstraction has 1134 states and 2445 transitions. [2019-12-27 22:42:21,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:42:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 2445 transitions. [2019-12-27 22:42:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:42:21,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:21,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:21,143 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:21,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-27 22:42:21,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:21,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907884112] [2019-12-27 22:42:21,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:21,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907884112] [2019-12-27 22:42:21,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:21,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:42:21,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [48912449] [2019-12-27 22:42:21,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:21,248 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:21,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:42:21,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:21,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:21,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:42:21,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:42:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:42:21,256 INFO L87 Difference]: Start difference. First operand 1134 states and 2445 transitions. Second operand 6 states. [2019-12-27 22:42:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:21,487 INFO L93 Difference]: Finished difference Result 1152 states and 2455 transitions. [2019-12-27 22:42:21,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:42:21,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 22:42:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:21,490 INFO L225 Difference]: With dead ends: 1152 [2019-12-27 22:42:21,490 INFO L226 Difference]: Without dead ends: 1099 [2019-12-27 22:42:21,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:42:21,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-12-27 22:42:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1078. [2019-12-27 22:42:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-12-27 22:42:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 2326 transitions. [2019-12-27 22:42:21,506 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 2326 transitions. Word has length 25 [2019-12-27 22:42:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:21,507 INFO L462 AbstractCegarLoop]: Abstraction has 1078 states and 2326 transitions. [2019-12-27 22:42:21,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:42:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 2326 transitions. [2019-12-27 22:42:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 22:42:21,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:21,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:21,509 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:21,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1580443706, now seen corresponding path program 1 times [2019-12-27 22:42:21,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:21,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917334804] [2019-12-27 22:42:21,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:21,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917334804] [2019-12-27 22:42:21,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:21,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:42:21,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [190033658] [2019-12-27 22:42:21,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:21,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:21,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 22:42:21,622 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:21,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:42:21,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:42:21,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:21,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:42:21,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:42:21,792 INFO L87 Difference]: Start difference. First operand 1078 states and 2326 transitions. Second operand 6 states. [2019-12-27 22:42:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:21,833 INFO L93 Difference]: Finished difference Result 545 states and 1149 transitions. [2019-12-27 22:42:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:42:21,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 22:42:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:21,834 INFO L225 Difference]: With dead ends: 545 [2019-12-27 22:42:21,834 INFO L226 Difference]: Without dead ends: 460 [2019-12-27 22:42:21,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:42:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-27 22:42:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2019-12-27 22:42:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-12-27 22:42:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1003 transitions. [2019-12-27 22:42:21,841 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1003 transitions. Word has length 28 [2019-12-27 22:42:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:21,842 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 1003 transitions. [2019-12-27 22:42:21,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:42:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1003 transitions. [2019-12-27 22:42:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:42:21,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:21,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:21,844 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:21,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:21,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1967696263, now seen corresponding path program 1 times [2019-12-27 22:42:21,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:21,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159504972] [2019-12-27 22:42:21,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:21,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159504972] [2019-12-27 22:42:21,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:21,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:42:21,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1313633747] [2019-12-27 22:42:21,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:21,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:22,012 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 125 transitions. [2019-12-27 22:42:22,012 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:22,090 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:42:22,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:42:22,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:22,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:42:22,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:42:22,092 INFO L87 Difference]: Start difference. First operand 460 states and 1003 transitions. Second operand 9 states. [2019-12-27 22:42:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:22,323 INFO L93 Difference]: Finished difference Result 962 states and 2027 transitions. [2019-12-27 22:42:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:42:22,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 22:42:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:22,325 INFO L225 Difference]: With dead ends: 962 [2019-12-27 22:42:22,325 INFO L226 Difference]: Without dead ends: 671 [2019-12-27 22:42:22,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:42:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-12-27 22:42:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 517. [2019-12-27 22:42:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-12-27 22:42:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1102 transitions. [2019-12-27 22:42:22,334 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1102 transitions. Word has length 52 [2019-12-27 22:42:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:22,335 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 1102 transitions. [2019-12-27 22:42:22,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:42:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1102 transitions. [2019-12-27 22:42:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:42:22,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:22,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:22,338 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash 689321111, now seen corresponding path program 2 times [2019-12-27 22:42:22,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:22,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857944707] [2019-12-27 22:42:22,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:22,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857944707] [2019-12-27 22:42:22,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:22,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:42:22,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [657229042] [2019-12-27 22:42:22,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:22,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:22,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 127 transitions. [2019-12-27 22:42:22,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:22,601 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:42:22,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:42:22,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:22,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:42:22,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:42:22,603 INFO L87 Difference]: Start difference. First operand 517 states and 1102 transitions. Second operand 7 states. [2019-12-27 22:42:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:23,462 INFO L93 Difference]: Finished difference Result 1207 states and 2542 transitions. [2019-12-27 22:42:23,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:42:23,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 22:42:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:23,464 INFO L225 Difference]: With dead ends: 1207 [2019-12-27 22:42:23,464 INFO L226 Difference]: Without dead ends: 1183 [2019-12-27 22:42:23,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:42:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-12-27 22:42:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 779. [2019-12-27 22:42:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-12-27 22:42:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1690 transitions. [2019-12-27 22:42:23,479 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1690 transitions. Word has length 52 [2019-12-27 22:42:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:23,480 INFO L462 AbstractCegarLoop]: Abstraction has 779 states and 1690 transitions. [2019-12-27 22:42:23,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:42:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1690 transitions. [2019-12-27 22:42:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:42:23,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:23,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:23,482 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:23,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1511703527, now seen corresponding path program 3 times [2019-12-27 22:42:23,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:23,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254384695] [2019-12-27 22:42:23,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:23,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254384695] [2019-12-27 22:42:23,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:23,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:42:23,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2092252799] [2019-12-27 22:42:23,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:23,566 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:23,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 102 transitions. [2019-12-27 22:42:23,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:23,618 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:23,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:23,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:23,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:23,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:23,620 INFO L87 Difference]: Start difference. First operand 779 states and 1690 transitions. Second operand 3 states. [2019-12-27 22:42:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:23,683 INFO L93 Difference]: Finished difference Result 969 states and 2083 transitions. [2019-12-27 22:42:23,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:23,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 22:42:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:23,686 INFO L225 Difference]: With dead ends: 969 [2019-12-27 22:42:23,687 INFO L226 Difference]: Without dead ends: 969 [2019-12-27 22:42:23,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-12-27 22:42:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 759. [2019-12-27 22:42:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-27 22:42:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1644 transitions. [2019-12-27 22:42:23,704 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1644 transitions. Word has length 52 [2019-12-27 22:42:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:23,705 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1644 transitions. [2019-12-27 22:42:23,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1644 transitions. [2019-12-27 22:42:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:42:23,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:23,707 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:23,708 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:23,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-27 22:42:23,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:23,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917455876] [2019-12-27 22:42:23,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:42:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:42:23,927 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:42:23,928 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:42:23,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2315~0.base_24| 4)) (= 0 v_~y$mem_tmp~0_9) (= 0 v_~y$r_buff1_thd1~0_21) (= |v_ULTIMATE.start_main_~#t2315~0.offset_19| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_24|) |v_ULTIMATE.start_main_~#t2315~0.offset_19| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2315~0.base_24|) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd2~0_83 0) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$w_buff0_used~0_106 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_24|)) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_24| 1)) (= 0 v_~y$r_buff1_thd2~0_52) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_17|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2315~0.offset=|v_ULTIMATE.start_main_~#t2315~0.offset_19|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2315~0.base=|v_ULTIMATE.start_main_~#t2315~0.base_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2316~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2316~0.base, #NULL.base, ULTIMATE.start_main_~#t2315~0.offset, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2315~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:42:23,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2316~0.offset_11| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13|) |v_ULTIMATE.start_main_~#t2316~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_13|, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2316~0.base, ULTIMATE.start_main_~#t2316~0.offset] because there is no mapped edge [2019-12-27 22:42:23,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (= ~y$r_buff0_thd1~0_In-877219887 ~y$r_buff1_thd1~0_Out-877219887) (= 1 ~x~0_Out-877219887) (= 1 ~y$r_buff0_thd1~0_Out-877219887) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-877219887)) (= ~y$r_buff1_thd0~0_Out-877219887 ~y$r_buff0_thd0~0_In-877219887) (= ~y$r_buff1_thd2~0_Out-877219887 ~y$r_buff0_thd2~0_In-877219887)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-877219887, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-877219887, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-877219887, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-877219887} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-877219887, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-877219887, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-877219887, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-877219887, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-877219887, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-877219887, ~x~0=~x~0_Out-877219887, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-877219887} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 22:42:23,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1580695497 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1580695497 256)))) (or (and (= ~y$w_buff0_used~0_In-1580695497 |P0Thread1of1ForFork0_#t~ite5_Out-1580695497|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1580695497| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580695497, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1580695497} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1580695497|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580695497, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1580695497} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:42:23,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1493246481 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In1493246481| |P1Thread1of1ForFork1_#t~ite20_Out1493246481|) (= |P1Thread1of1ForFork1_#t~ite21_Out1493246481| ~y$w_buff0_used~0_In1493246481)) (and (= ~y$w_buff0_used~0_In1493246481 |P1Thread1of1ForFork1_#t~ite20_Out1493246481|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1493246481 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1493246481 256)) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1493246481 256))) (= (mod ~y$w_buff0_used~0_In1493246481 256) 0))) (= |P1Thread1of1ForFork1_#t~ite21_Out1493246481| |P1Thread1of1ForFork1_#t~ite20_Out1493246481|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1493246481, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1493246481, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1493246481|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1493246481, ~weak$$choice2~0=~weak$$choice2~0_In1493246481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1493246481} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1493246481, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1493246481, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1493246481|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1493246481, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1493246481|, ~weak$$choice2~0=~weak$$choice2~0_In1493246481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1493246481} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 22:42:23,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-657117839| |P1Thread1of1ForFork1_#t~ite24_Out-657117839|)) (.cse5 (= (mod ~weak$$choice2~0_In-657117839 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-657117839 256))) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In-657117839 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-657117839 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-657117839 256) 0))) (or (and (or (and .cse0 (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4) .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-657117839| ~y$w_buff1_used~0_In-657117839)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-657117839| |P1Thread1of1ForFork1_#t~ite23_In-657117839|) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite24_Out-657117839| ~y$w_buff1_used~0_In-657117839))) (= |P1Thread1of1ForFork1_#t~ite22_In-657117839| |P1Thread1of1ForFork1_#t~ite22_Out-657117839|)) (let ((.cse6 (not .cse1))) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-657117839| |P1Thread1of1ForFork1_#t~ite22_Out-657117839|) .cse0 .cse5 (or (not .cse3) .cse6) (not .cse4) (or .cse6 (not .cse2)) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-657117839|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-657117839, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-657117839, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-657117839, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-657117839|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-657117839|, ~weak$$choice2~0=~weak$$choice2~0_In-657117839, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-657117839} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-657117839, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-657117839, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-657117839, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-657117839|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-657117839|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-657117839|, ~weak$$choice2~0=~weak$$choice2~0_In-657117839, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-657117839} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 22:42:23,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 22:42:23,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In65996921 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In65996921 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In65996921 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In65996921 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out65996921| ~y$w_buff1_used~0_In65996921) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out65996921| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In65996921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65996921, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In65996921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65996921} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out65996921|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In65996921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65996921, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In65996921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65996921} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:42:23,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-846187184 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-846187184 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-846187184 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out-846187184 ~y$r_buff0_thd1~0_In-846187184) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-846187184, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-846187184} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-846187184, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-846187184|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-846187184} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:42:23,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse2 (= 0 (mod ~weak$$choice2~0_In-429830015 256))) (.cse4 (= |P1Thread1of1ForFork1_#t~ite30_Out-429830015| |P1Thread1of1ForFork1_#t~ite29_Out-429830015|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-429830015 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-429830015 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-429830015 256))) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In-429830015 256)))) (or (let ((.cse0 (not .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-429830015| |P1Thread1of1ForFork1_#t~ite29_Out-429830015|) (or .cse0 (not .cse1)) (= |P1Thread1of1ForFork1_#t~ite28_Out-429830015| 0) .cse2 (or .cse0 (not .cse3)) .cse4 (not .cse5))) (and (or (and (= ~y$r_buff1_thd2~0_In-429830015 |P1Thread1of1ForFork1_#t~ite30_Out-429830015|) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite29_In-429830015| |P1Thread1of1ForFork1_#t~ite29_Out-429830015|)) (and (= ~y$r_buff1_thd2~0_In-429830015 |P1Thread1of1ForFork1_#t~ite29_Out-429830015|) .cse2 .cse4 (or (and .cse6 .cse1) (and .cse3 .cse6) .cse5))) (= |P1Thread1of1ForFork1_#t~ite28_In-429830015| |P1Thread1of1ForFork1_#t~ite28_Out-429830015|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-429830015, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-429830015|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-429830015, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-429830015, ~weak$$choice2~0=~weak$$choice2~0_In-429830015, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-429830015|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-429830015} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-429830015, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-429830015|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-429830015|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-429830015, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-429830015, ~weak$$choice2~0=~weak$$choice2~0_In-429830015, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-429830015|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-429830015} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 22:42:23,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In947085904 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In947085904 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In947085904 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In947085904 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out947085904|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In947085904 |P0Thread1of1ForFork0_#t~ite8_Out947085904|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In947085904, ~y$w_buff0_used~0=~y$w_buff0_used~0_In947085904, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In947085904, ~y$w_buff1_used~0=~y$w_buff1_used~0_In947085904} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In947085904, ~y$w_buff0_used~0=~y$w_buff0_used~0_In947085904, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out947085904|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In947085904, ~y$w_buff1_used~0=~y$w_buff1_used~0_In947085904} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:42:23,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 22:42:23,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1096129299 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1096129299 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1096129299| ~y~0_In-1096129299)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1096129299| ~y$w_buff1~0_In-1096129299) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1096129299, ~y$w_buff1~0=~y$w_buff1~0_In-1096129299, ~y~0=~y~0_In-1096129299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1096129299} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1096129299, ~y$w_buff1~0=~y$w_buff1~0_In-1096129299, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1096129299|, ~y~0=~y~0_In-1096129299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1096129299} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:42:23,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 22:42:23,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2090957103 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2090957103 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2090957103 |P1Thread1of1ForFork1_#t~ite34_Out-2090957103|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2090957103|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090957103, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2090957103} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090957103, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2090957103, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2090957103|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:42:23,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In550775004 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In550775004 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In550775004 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In550775004 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out550775004|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In550775004 |P1Thread1of1ForFork1_#t~ite35_Out550775004|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In550775004, ~y$w_buff0_used~0=~y$w_buff0_used~0_In550775004, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In550775004, ~y$w_buff1_used~0=~y$w_buff1_used~0_In550775004} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In550775004, ~y$w_buff0_used~0=~y$w_buff0_used~0_In550775004, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In550775004, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out550775004|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In550775004} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:42:23,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-244078989 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-244078989 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-244078989|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-244078989 |P1Thread1of1ForFork1_#t~ite36_Out-244078989|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-244078989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-244078989} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-244078989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-244078989, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-244078989|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:42:23,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In2088314378 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2088314378 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2088314378 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2088314378 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out2088314378| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out2088314378| ~y$r_buff1_thd2~0_In2088314378) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2088314378, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2088314378, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2088314378, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2088314378} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2088314378, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2088314378, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2088314378, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out2088314378|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2088314378} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:42:23,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:42:23,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:42:23,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:42:23,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-768640689 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-768640689 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-768640689| ~y~0_In-768640689)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-768640689| ~y$w_buff1~0_In-768640689)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-768640689, ~y~0=~y~0_In-768640689, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-768640689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-768640689} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-768640689|, ~y$w_buff1~0=~y$w_buff1~0_In-768640689, ~y~0=~y~0_In-768640689, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-768640689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-768640689} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 22:42:23,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 22:42:23,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2052932237 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2052932237 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2052932237 |ULTIMATE.start_main_#t~ite42_Out-2052932237|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-2052932237|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2052932237, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2052932237} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2052932237, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2052932237, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2052932237|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:42:23,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1294700771 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1294700771 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1294700771 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1294700771 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1294700771|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1294700771 |ULTIMATE.start_main_#t~ite43_Out-1294700771|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294700771, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1294700771, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1294700771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1294700771} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294700771, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1294700771, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1294700771|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1294700771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1294700771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:42:23,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-178459319 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-178459319 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-178459319 |ULTIMATE.start_main_#t~ite44_Out-178459319|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-178459319|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-178459319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-178459319} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-178459319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-178459319, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-178459319|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:42:23,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In539797626 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In539797626 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In539797626 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In539797626 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out539797626| ~y$r_buff1_thd0~0_In539797626) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out539797626| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In539797626, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In539797626, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In539797626, ~y$w_buff1_used~0=~y$w_buff1_used~0_In539797626} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In539797626, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In539797626, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In539797626, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out539797626|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In539797626} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:42:23,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:42:24,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:42:24 BasicIcfg [2019-12-27 22:42:24,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:42:24,058 INFO L168 Benchmark]: Toolchain (without parser) took 14594.41 ms. Allocated memory was 143.7 MB in the beginning and 655.4 MB in the end (delta: 511.7 MB). Free memory was 99.2 MB in the beginning and 324.3 MB in the end (delta: -225.1 MB). Peak memory consumption was 286.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:24,058 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 22:42:24,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.17 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.9 MB in the beginning and 155.1 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:24,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.12 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:24,062 INFO L168 Benchmark]: Boogie Preprocessor took 54.75 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:24,063 INFO L168 Benchmark]: RCFGBuilder took 797.92 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 106.3 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:24,064 INFO L168 Benchmark]: TraceAbstraction took 12851.07 ms. Allocated memory was 201.3 MB in the beginning and 655.4 MB in the end (delta: 454.0 MB). Free memory was 105.6 MB in the beginning and 324.3 MB in the end (delta: -218.7 MB). Peak memory consumption was 235.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:24,075 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.17 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.9 MB in the beginning and 155.1 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.12 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.75 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.92 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 106.3 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12851.07 ms. Allocated memory was 201.3 MB in the beginning and 655.4 MB in the end (delta: 454.0 MB). Free memory was 105.6 MB in the beginning and 324.3 MB in the end (delta: -218.7 MB). Peak memory consumption was 235.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4545 VarBasedMoverChecksPositive, 161 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1244 SDtfs, 1563 SDslu, 2193 SDs, 0 SdLazy, 1235 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 26 SyntacticMatches, 13 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11080occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 5108 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 28813 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...