/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:31:31,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:31:31,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:31:31,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:31:31,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:31:31,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:31:31,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:31:31,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:31:31,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:31:31,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:31:31,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:31:31,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:31:31,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:31:31,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:31:31,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:31:31,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:31:31,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:31:31,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:31:31,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:31:31,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:31:31,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:31:31,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:31:31,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:31:31,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:31:31,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:31:31,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:31:31,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:31:31,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:31:31,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:31:31,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:31:31,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:31:31,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:31:31,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:31:31,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:31:31,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:31:31,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:31:31,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:31:31,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:31:31,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:31:31,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:31:31,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:31:31,381 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-SemanticLbe.epf [2019-12-18 16:31:31,401 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:31:31,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:31:31,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:31:31,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:31:31,403 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:31:31,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:31:31,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:31:31,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:31:31,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:31:31,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:31:31,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:31:31,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:31:31,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:31:31,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:31:31,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:31:31,407 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:31:31,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:31:31,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:31:31,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:31:31,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:31:31,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:31:31,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:31:31,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:31:31,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:31:31,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:31:31,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:31:31,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:31:31,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:31:31,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:31:31,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:31:31,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:31:31,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:31:31,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:31:31,708 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:31:31,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_tso.opt.i [2019-12-18 16:31:31,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba613068/b105238b6cc04e9995fafa77d60787fe/FLAG80950a81b [2019-12-18 16:31:32,366 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:31:32,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_tso.opt.i [2019-12-18 16:31:32,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba613068/b105238b6cc04e9995fafa77d60787fe/FLAG80950a81b [2019-12-18 16:31:32,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba613068/b105238b6cc04e9995fafa77d60787fe [2019-12-18 16:31:32,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:31:32,649 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:31:32,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:31:32,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:31:32,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:31:32,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:31:32" (1/1) ... [2019-12-18 16:31:32,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f2a089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:32, skipping insertion in model container [2019-12-18 16:31:32,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:31:32" (1/1) ... [2019-12-18 16:31:32,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:31:32,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:31:33,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:31:33,302 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:31:33,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:31:33,450 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:31:33,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33 WrapperNode [2019-12-18 16:31:33,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:31:33,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:31:33,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:31:33,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:31:33,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33" (1/1) ... [2019-12-18 16:31:33,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33" (1/1) ... [2019-12-18 16:31:33,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:31:33,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:31:33,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:31:33,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:31:33,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33" (1/1) ... [2019-12-18 16:31:33,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33" (1/1) ... [2019-12-18 16:31:33,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33" (1/1) ... [2019-12-18 16:31:33,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33" (1/1) ... [2019-12-18 16:31:33,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33" (1/1) ... [2019-12-18 16:31:33,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33" (1/1) ... [2019-12-18 16:31:33,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33" (1/1) ... [2019-12-18 16:31:33,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:31:33,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:31:33,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:31:33,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:31:33,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33" (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-18 16:31:33,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:31:33,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:31:33,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:31:33,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:31:33,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:31:33,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:31:33,640 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:31:33,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:31:33,640 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:31:33,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:31:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:31:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:31:33,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:31:33,643 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:31:34,467 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:31:34,467 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:31:34,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:31:34 BoogieIcfgContainer [2019-12-18 16:31:34,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:31:34,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:31:34,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:31:34,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:31:34,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:31:32" (1/3) ... [2019-12-18 16:31:34,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1019f19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:31:34, skipping insertion in model container [2019-12-18 16:31:34,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:33" (2/3) ... [2019-12-18 16:31:34,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1019f19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:31:34, skipping insertion in model container [2019-12-18 16:31:34,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:31:34" (3/3) ... [2019-12-18 16:31:34,479 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_tso.opt.i [2019-12-18 16:31:34,489 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:31:34,489 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:31:34,497 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:31:34,497 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:31:34,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,555 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,556 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,576 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,576 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,605 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,605 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,607 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,613 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:34,636 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:31:34,656 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:31:34,656 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:31:34,656 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:31:34,656 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:31:34,657 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:31:34,657 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:31:34,657 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:31:34,657 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:31:34,674 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-18 16:31:34,676 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-18 16:31:34,777 INFO L126 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-18 16:31:34,778 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:31:34,801 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 16:31:34,837 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-18 16:31:34,900 INFO L126 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-18 16:31:34,900 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:31:34,911 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 16:31:34,941 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 16:31:34,943 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:31:40,210 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-18 16:31:40,662 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 16:31:40,795 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 16:31:40,839 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147047 [2019-12-18 16:31:40,840 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-18 16:31:40,843 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 111 places, 134 transitions [2019-12-18 16:31:45,232 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 48534 states. [2019-12-18 16:31:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 48534 states. [2019-12-18 16:31:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 16:31:45,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:45,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:45,244 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:45,249 INFO L82 PathProgramCache]: Analyzing trace with hash 746662760, now seen corresponding path program 1 times [2019-12-18 16:31:45,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:45,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781109239] [2019-12-18 16:31:45,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:45,578 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-18 16:31:45,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781109239] [2019-12-18 16:31:45,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:45,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:31:45,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789266209] [2019-12-18 16:31:45,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:31:45,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:45,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:31:45,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:45,605 INFO L87 Difference]: Start difference. First operand 48534 states. Second operand 3 states. [2019-12-18 16:31:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:46,363 INFO L93 Difference]: Finished difference Result 48214 states and 197664 transitions. [2019-12-18 16:31:46,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:31:46,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 16:31:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:46,770 INFO L225 Difference]: With dead ends: 48214 [2019-12-18 16:31:46,771 INFO L226 Difference]: Without dead ends: 44902 [2019-12-18 16:31:46,772 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-18 16:31:48,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44902 states. [2019-12-18 16:31:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44902 to 44902. [2019-12-18 16:31:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44902 states. [2019-12-18 16:31:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44902 states to 44902 states and 183960 transitions. [2019-12-18 16:31:50,929 INFO L78 Accepts]: Start accepts. Automaton has 44902 states and 183960 transitions. Word has length 7 [2019-12-18 16:31:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:50,931 INFO L462 AbstractCegarLoop]: Abstraction has 44902 states and 183960 transitions. [2019-12-18 16:31:50,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:31:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 44902 states and 183960 transitions. [2019-12-18 16:31:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:31:50,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:50,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:50,938 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:50,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1082779043, now seen corresponding path program 1 times [2019-12-18 16:31:50,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:50,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901186706] [2019-12-18 16:31:50,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:51,072 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-18 16:31:51,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901186706] [2019-12-18 16:31:51,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:51,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:31:51,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127327161] [2019-12-18 16:31:51,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:31:51,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:51,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:31:51,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:31:51,077 INFO L87 Difference]: Start difference. First operand 44902 states and 183960 transitions. Second operand 4 states. [2019-12-18 16:31:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:51,882 INFO L93 Difference]: Finished difference Result 71574 states and 281396 transitions. [2019-12-18 16:31:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:31:51,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:31:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:54,473 INFO L225 Difference]: With dead ends: 71574 [2019-12-18 16:31:54,473 INFO L226 Difference]: Without dead ends: 71542 [2019-12-18 16:31:54,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 16:31:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71542 states. [2019-12-18 16:31:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71542 to 69774. [2019-12-18 16:31:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69774 states. [2019-12-18 16:31:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69774 states to 69774 states and 275806 transitions. [2019-12-18 16:31:57,150 INFO L78 Accepts]: Start accepts. Automaton has 69774 states and 275806 transitions. Word has length 13 [2019-12-18 16:31:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:57,150 INFO L462 AbstractCegarLoop]: Abstraction has 69774 states and 275806 transitions. [2019-12-18 16:31:57,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:31:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 69774 states and 275806 transitions. [2019-12-18 16:31:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:31:57,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:57,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:57,158 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:57,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash 837864252, now seen corresponding path program 1 times [2019-12-18 16:31:57,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:57,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490077806] [2019-12-18 16:31:57,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:57,243 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-18 16:31:57,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490077806] [2019-12-18 16:31:57,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:57,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:31:57,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279857830] [2019-12-18 16:31:57,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:31:57,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:57,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:31:57,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:31:57,246 INFO L87 Difference]: Start difference. First operand 69774 states and 275806 transitions. Second operand 4 states. [2019-12-18 16:31:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:58,399 INFO L93 Difference]: Finished difference Result 88624 states and 345355 transitions. [2019-12-18 16:31:58,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:31:58,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:31:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:58,668 INFO L225 Difference]: With dead ends: 88624 [2019-12-18 16:31:58,668 INFO L226 Difference]: Without dead ends: 88596 [2019-12-18 16:31:58,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 16:32:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88596 states. [2019-12-18 16:32:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88596 to 79570. [2019-12-18 16:32:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79570 states. [2019-12-18 16:32:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79570 states to 79570 states and 312836 transitions. [2019-12-18 16:32:04,030 INFO L78 Accepts]: Start accepts. Automaton has 79570 states and 312836 transitions. Word has length 16 [2019-12-18 16:32:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:04,030 INFO L462 AbstractCegarLoop]: Abstraction has 79570 states and 312836 transitions. [2019-12-18 16:32:04,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:32:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 79570 states and 312836 transitions. [2019-12-18 16:32:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 16:32:04,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:04,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:04,038 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:04,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:04,039 INFO L82 PathProgramCache]: Analyzing trace with hash 204017463, now seen corresponding path program 1 times [2019-12-18 16:32:04,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:04,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711096011] [2019-12-18 16:32:04,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:04,102 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-18 16:32:04,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711096011] [2019-12-18 16:32:04,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:04,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:04,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882776437] [2019-12-18 16:32:04,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:32:04,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:04,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:32:04,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:32:04,104 INFO L87 Difference]: Start difference. First operand 79570 states and 312836 transitions. Second operand 3 states. [2019-12-18 16:32:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:08,068 INFO L93 Difference]: Finished difference Result 132064 states and 498805 transitions. [2019-12-18 16:32:08,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:32:08,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 16:32:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:08,410 INFO L225 Difference]: With dead ends: 132064 [2019-12-18 16:32:08,410 INFO L226 Difference]: Without dead ends: 132064 [2019-12-18 16:32:08,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 16:32:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132064 states. [2019-12-18 16:32:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132064 to 117574. [2019-12-18 16:32:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117574 states. [2019-12-18 16:32:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117574 states to 117574 states and 450334 transitions. [2019-12-18 16:32:12,136 INFO L78 Accepts]: Start accepts. Automaton has 117574 states and 450334 transitions. Word has length 17 [2019-12-18 16:32:12,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:12,137 INFO L462 AbstractCegarLoop]: Abstraction has 117574 states and 450334 transitions. [2019-12-18 16:32:12,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:32:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 117574 states and 450334 transitions. [2019-12-18 16:32:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 16:32:12,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:12,147 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-18 16:32:12,147 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:12,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash 628271860, now seen corresponding path program 1 times [2019-12-18 16:32:12,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:12,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195828328] [2019-12-18 16:32:12,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:12,207 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-18 16:32:12,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195828328] [2019-12-18 16:32:12,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:12,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:32:12,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037568984] [2019-12-18 16:32:12,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:32:12,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:12,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:32:12,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:32:12,209 INFO L87 Difference]: Start difference. First operand 117574 states and 450334 transitions. Second operand 3 states. [2019-12-18 16:32:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:13,662 INFO L93 Difference]: Finished difference Result 110770 states and 423756 transitions. [2019-12-18 16:32:13,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:32:13,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 16:32:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:13,954 INFO L225 Difference]: With dead ends: 110770 [2019-12-18 16:32:13,954 INFO L226 Difference]: Without dead ends: 110770 [2019-12-18 16:32:13,955 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-18 16:32:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110770 states. [2019-12-18 16:32:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110770 to 110770. [2019-12-18 16:32:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110770 states. [2019-12-18 16:32:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110770 states to 110770 states and 423756 transitions. [2019-12-18 16:32:21,359 INFO L78 Accepts]: Start accepts. Automaton has 110770 states and 423756 transitions. Word has length 18 [2019-12-18 16:32:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:21,359 INFO L462 AbstractCegarLoop]: Abstraction has 110770 states and 423756 transitions. [2019-12-18 16:32:21,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:32:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 110770 states and 423756 transitions. [2019-12-18 16:32:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:32:21,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:21,371 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-18 16:32:21,372 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1364222767, now seen corresponding path program 1 times [2019-12-18 16:32:21,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:21,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087165101] [2019-12-18 16:32:21,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:21,439 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-18 16:32:21,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087165101] [2019-12-18 16:32:21,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:21,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:32:21,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29959040] [2019-12-18 16:32:21,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:32:21,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:21,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:32:21,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:32:21,442 INFO L87 Difference]: Start difference. First operand 110770 states and 423756 transitions. Second operand 4 states. [2019-12-18 16:32:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:22,357 INFO L93 Difference]: Finished difference Result 136240 states and 514357 transitions. [2019-12-18 16:32:22,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:32:22,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 16:32:22,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:26,760 INFO L225 Difference]: With dead ends: 136240 [2019-12-18 16:32:26,760 INFO L226 Difference]: Without dead ends: 136206 [2019-12-18 16:32:26,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 16:32:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136206 states. [2019-12-18 16:32:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136206 to 112236. [2019-12-18 16:32:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112236 states. [2019-12-18 16:32:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112236 states to 112236 states and 429275 transitions. [2019-12-18 16:32:30,193 INFO L78 Accepts]: Start accepts. Automaton has 112236 states and 429275 transitions. Word has length 19 [2019-12-18 16:32:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:30,194 INFO L462 AbstractCegarLoop]: Abstraction has 112236 states and 429275 transitions. [2019-12-18 16:32:30,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:32:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 112236 states and 429275 transitions. [2019-12-18 16:32:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:32:30,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:30,212 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] [2019-12-18 16:32:30,212 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:30,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:30,213 INFO L82 PathProgramCache]: Analyzing trace with hash -353279239, now seen corresponding path program 1 times [2019-12-18 16:32:30,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:30,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412612730] [2019-12-18 16:32:30,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:30,324 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-18 16:32:30,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412612730] [2019-12-18 16:32:30,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:30,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:30,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811791688] [2019-12-18 16:32:30,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:30,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:30,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:30,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:30,326 INFO L87 Difference]: Start difference. First operand 112236 states and 429275 transitions. Second operand 5 states. [2019-12-18 16:32:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:32,548 INFO L93 Difference]: Finished difference Result 158312 states and 591867 transitions. [2019-12-18 16:32:32,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:32:32,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:32:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:32,970 INFO L225 Difference]: With dead ends: 158312 [2019-12-18 16:32:32,970 INFO L226 Difference]: Without dead ends: 158284 [2019-12-18 16:32:32,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:32:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158284 states. [2019-12-18 16:32:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158284 to 121558. [2019-12-18 16:32:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121558 states. [2019-12-18 16:32:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121558 states to 121558 states and 462936 transitions. [2019-12-18 16:32:41,897 INFO L78 Accepts]: Start accepts. Automaton has 121558 states and 462936 transitions. Word has length 22 [2019-12-18 16:32:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:41,897 INFO L462 AbstractCegarLoop]: Abstraction has 121558 states and 462936 transitions. [2019-12-18 16:32:41,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 121558 states and 462936 transitions. [2019-12-18 16:32:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:32:41,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:41,949 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-18 16:32:41,949 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:41,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2009208716, now seen corresponding path program 1 times [2019-12-18 16:32:41,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:41,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573972316] [2019-12-18 16:32:41,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:42,019 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-18 16:32:42,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573972316] [2019-12-18 16:32:42,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:42,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:42,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912420193] [2019-12-18 16:32:42,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:32:42,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:42,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:32:42,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:32:42,022 INFO L87 Difference]: Start difference. First operand 121558 states and 462936 transitions. Second operand 4 states. [2019-12-18 16:32:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:42,328 INFO L93 Difference]: Finished difference Result 77069 states and 255043 transitions. [2019-12-18 16:32:42,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:32:42,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:32:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:42,448 INFO L225 Difference]: With dead ends: 77069 [2019-12-18 16:32:42,448 INFO L226 Difference]: Without dead ends: 68005 [2019-12-18 16:32:42,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 16:32:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68005 states. [2019-12-18 16:32:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68005 to 68005. [2019-12-18 16:32:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68005 states. [2019-12-18 16:32:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68005 states to 68005 states and 225117 transitions. [2019-12-18 16:32:44,531 INFO L78 Accepts]: Start accepts. Automaton has 68005 states and 225117 transitions. Word has length 25 [2019-12-18 16:32:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:44,532 INFO L462 AbstractCegarLoop]: Abstraction has 68005 states and 225117 transitions. [2019-12-18 16:32:44,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:32:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 68005 states and 225117 transitions. [2019-12-18 16:32:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 16:32:44,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:44,554 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] [2019-12-18 16:32:44,554 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1299418381, now seen corresponding path program 1 times [2019-12-18 16:32:44,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:44,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081381591] [2019-12-18 16:32:44,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:44,633 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-18 16:32:44,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081381591] [2019-12-18 16:32:44,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:44,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:32:44,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483342283] [2019-12-18 16:32:44,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:44,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:44,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:44,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:44,635 INFO L87 Difference]: Start difference. First operand 68005 states and 225117 transitions. Second operand 5 states. [2019-12-18 16:32:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:44,757 INFO L93 Difference]: Finished difference Result 16686 states and 47973 transitions. [2019-12-18 16:32:44,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:32:44,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 16:32:44,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:44,777 INFO L225 Difference]: With dead ends: 16686 [2019-12-18 16:32:44,777 INFO L226 Difference]: Without dead ends: 11858 [2019-12-18 16:32:44,777 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-18 16:32:46,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2019-12-18 16:32:46,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 11762. [2019-12-18 16:32:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11762 states. [2019-12-18 16:32:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11762 states to 11762 states and 31947 transitions. [2019-12-18 16:32:46,885 INFO L78 Accepts]: Start accepts. Automaton has 11762 states and 31947 transitions. Word has length 26 [2019-12-18 16:32:46,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:46,885 INFO L462 AbstractCegarLoop]: Abstraction has 11762 states and 31947 transitions. [2019-12-18 16:32:46,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 11762 states and 31947 transitions. [2019-12-18 16:32:46,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:32:46,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:46,896 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] [2019-12-18 16:32:46,896 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:46,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:46,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1846791940, now seen corresponding path program 1 times [2019-12-18 16:32:46,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:46,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283999268] [2019-12-18 16:32:46,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:46,943 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-18 16:32:46,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283999268] [2019-12-18 16:32:46,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:46,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:46,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134808144] [2019-12-18 16:32:46,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:32:46,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:46,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:32:46,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:32:46,946 INFO L87 Difference]: Start difference. First operand 11762 states and 31947 transitions. Second operand 3 states. [2019-12-18 16:32:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:47,039 INFO L93 Difference]: Finished difference Result 12587 states and 32419 transitions. [2019-12-18 16:32:47,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:32:47,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-18 16:32:47,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:47,056 INFO L225 Difference]: With dead ends: 12587 [2019-12-18 16:32:47,056 INFO L226 Difference]: Without dead ends: 12587 [2019-12-18 16:32:47,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 16:32:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12587 states. [2019-12-18 16:32:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12587 to 11835. [2019-12-18 16:32:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11835 states. [2019-12-18 16:32:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11835 states to 11835 states and 30702 transitions. [2019-12-18 16:32:47,211 INFO L78 Accepts]: Start accepts. Automaton has 11835 states and 30702 transitions. Word has length 34 [2019-12-18 16:32:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:47,211 INFO L462 AbstractCegarLoop]: Abstraction has 11835 states and 30702 transitions. [2019-12-18 16:32:47,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:32:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 11835 states and 30702 transitions. [2019-12-18 16:32:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 16:32:47,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:47,224 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] [2019-12-18 16:32:47,225 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:47,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:47,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1321912617, now seen corresponding path program 1 times [2019-12-18 16:32:47,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:47,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600755343] [2019-12-18 16:32:47,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:47,312 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-18 16:32:47,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600755343] [2019-12-18 16:32:47,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:47,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:47,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718332120] [2019-12-18 16:32:47,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:47,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:47,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:47,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:47,315 INFO L87 Difference]: Start difference. First operand 11835 states and 30702 transitions. Second operand 5 states. [2019-12-18 16:32:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:47,804 INFO L93 Difference]: Finished difference Result 12899 states and 32863 transitions. [2019-12-18 16:32:47,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:32:47,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 16:32:47,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:47,820 INFO L225 Difference]: With dead ends: 12899 [2019-12-18 16:32:47,820 INFO L226 Difference]: Without dead ends: 12898 [2019-12-18 16:32:47,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:32:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12898 states. [2019-12-18 16:32:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12898 to 10403. [2019-12-18 16:32:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10403 states. [2019-12-18 16:32:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10403 states to 10403 states and 27270 transitions. [2019-12-18 16:32:47,948 INFO L78 Accepts]: Start accepts. Automaton has 10403 states and 27270 transitions. Word has length 37 [2019-12-18 16:32:47,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:47,949 INFO L462 AbstractCegarLoop]: Abstraction has 10403 states and 27270 transitions. [2019-12-18 16:32:47,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:47,949 INFO L276 IsEmpty]: Start isEmpty. Operand 10403 states and 27270 transitions. [2019-12-18 16:32:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 16:32:47,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:47,959 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] [2019-12-18 16:32:47,959 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:47,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1088485062, now seen corresponding path program 1 times [2019-12-18 16:32:47,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:47,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602635909] [2019-12-18 16:32:47,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:48,026 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-18 16:32:48,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602635909] [2019-12-18 16:32:48,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:48,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:48,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995948327] [2019-12-18 16:32:48,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:32:48,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:32:48,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:32:48,028 INFO L87 Difference]: Start difference. First operand 10403 states and 27270 transitions. Second operand 4 states. [2019-12-18 16:32:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:48,082 INFO L93 Difference]: Finished difference Result 12549 states and 31958 transitions. [2019-12-18 16:32:48,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:32:48,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 16:32:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:48,097 INFO L225 Difference]: With dead ends: 12549 [2019-12-18 16:32:48,097 INFO L226 Difference]: Without dead ends: 10415 [2019-12-18 16:32:48,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 16:32:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10415 states. [2019-12-18 16:32:48,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10415 to 10393. [2019-12-18 16:32:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-18 16:32:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 27136 transitions. [2019-12-18 16:32:48,214 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 27136 transitions. Word has length 44 [2019-12-18 16:32:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:48,214 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 27136 transitions. [2019-12-18 16:32:48,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:32:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 27136 transitions. [2019-12-18 16:32:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 16:32:48,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:48,224 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] [2019-12-18 16:32:48,224 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:48,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:48,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1382399600, now seen corresponding path program 2 times [2019-12-18 16:32:48,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:48,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818517824] [2019-12-18 16:32:48,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:48,292 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-18 16:32:48,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818517824] [2019-12-18 16:32:48,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:48,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:48,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018259856] [2019-12-18 16:32:48,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:48,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:48,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:48,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:48,294 INFO L87 Difference]: Start difference. First operand 10393 states and 27136 transitions. Second operand 5 states. [2019-12-18 16:32:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:48,481 INFO L93 Difference]: Finished difference Result 15335 states and 40181 transitions. [2019-12-18 16:32:48,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:32:48,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-18 16:32:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:48,506 INFO L225 Difference]: With dead ends: 15335 [2019-12-18 16:32:48,506 INFO L226 Difference]: Without dead ends: 12691 [2019-12-18 16:32:48,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:32:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12691 states. [2019-12-18 16:32:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12691 to 12691. [2019-12-18 16:32:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12691 states. [2019-12-18 16:32:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12691 states to 12691 states and 33536 transitions. [2019-12-18 16:32:48,717 INFO L78 Accepts]: Start accepts. Automaton has 12691 states and 33536 transitions. Word has length 44 [2019-12-18 16:32:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:48,718 INFO L462 AbstractCegarLoop]: Abstraction has 12691 states and 33536 transitions. [2019-12-18 16:32:48,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 12691 states and 33536 transitions. [2019-12-18 16:32:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 16:32:48,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:48,735 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] [2019-12-18 16:32:48,735 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:48,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:48,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1081189571, now seen corresponding path program 1 times [2019-12-18 16:32:48,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:48,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124283443] [2019-12-18 16:32:48,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:48,872 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-18 16:32:48,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124283443] [2019-12-18 16:32:48,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:48,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:32:48,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044837187] [2019-12-18 16:32:48,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:48,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:48,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:48,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:48,875 INFO L87 Difference]: Start difference. First operand 12691 states and 33536 transitions. Second operand 5 states. [2019-12-18 16:32:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:49,483 INFO L93 Difference]: Finished difference Result 14472 states and 37733 transitions. [2019-12-18 16:32:49,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:32:49,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-18 16:32:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:49,501 INFO L225 Difference]: With dead ends: 14472 [2019-12-18 16:32:49,501 INFO L226 Difference]: Without dead ends: 14472 [2019-12-18 16:32:49,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:32:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14472 states. [2019-12-18 16:32:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14472 to 14058. [2019-12-18 16:32:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14058 states. [2019-12-18 16:32:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14058 states to 14058 states and 36862 transitions. [2019-12-18 16:32:49,664 INFO L78 Accepts]: Start accepts. Automaton has 14058 states and 36862 transitions. Word has length 45 [2019-12-18 16:32:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:49,664 INFO L462 AbstractCegarLoop]: Abstraction has 14058 states and 36862 transitions. [2019-12-18 16:32:49,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 14058 states and 36862 transitions. [2019-12-18 16:32:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-18 16:32:49,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:49,681 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] [2019-12-18 16:32:49,681 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:49,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:49,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1215930825, now seen corresponding path program 1 times [2019-12-18 16:32:49,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:49,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278716238] [2019-12-18 16:32:49,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:49,774 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-18 16:32:49,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278716238] [2019-12-18 16:32:49,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:49,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:32:49,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566938118] [2019-12-18 16:32:49,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:32:49,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:49,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:32:49,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:32:49,776 INFO L87 Difference]: Start difference. First operand 14058 states and 36862 transitions. Second operand 6 states. [2019-12-18 16:32:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:49,902 INFO L93 Difference]: Finished difference Result 11696 states and 31477 transitions. [2019-12-18 16:32:49,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:32:49,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-18 16:32:49,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:49,916 INFO L225 Difference]: With dead ends: 11696 [2019-12-18 16:32:49,916 INFO L226 Difference]: Without dead ends: 7319 [2019-12-18 16:32:49,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:32:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2019-12-18 16:32:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 6761. [2019-12-18 16:32:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6761 states. [2019-12-18 16:32:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 16408 transitions. [2019-12-18 16:32:50,038 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 16408 transitions. Word has length 46 [2019-12-18 16:32:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:50,039 INFO L462 AbstractCegarLoop]: Abstraction has 6761 states and 16408 transitions. [2019-12-18 16:32:50,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:32:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 16408 transitions. [2019-12-18 16:32:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-18 16:32:50,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:50,048 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:50,048 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:50,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:50,048 INFO L82 PathProgramCache]: Analyzing trace with hash -346046383, now seen corresponding path program 1 times [2019-12-18 16:32:50,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:50,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640911701] [2019-12-18 16:32:50,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:50,122 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-18 16:32:50,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640911701] [2019-12-18 16:32:50,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:50,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:32:50,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825486262] [2019-12-18 16:32:50,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:32:50,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:32:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:32:50,124 INFO L87 Difference]: Start difference. First operand 6761 states and 16408 transitions. Second operand 6 states. [2019-12-18 16:32:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:50,338 INFO L93 Difference]: Finished difference Result 12973 states and 31792 transitions. [2019-12-18 16:32:50,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:32:50,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-18 16:32:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:50,354 INFO L225 Difference]: With dead ends: 12973 [2019-12-18 16:32:50,355 INFO L226 Difference]: Without dead ends: 10372 [2019-12-18 16:32:50,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:32:50,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10372 states. [2019-12-18 16:32:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10372 to 7877. [2019-12-18 16:32:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7877 states. [2019-12-18 16:32:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 18920 transitions. [2019-12-18 16:32:50,542 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 18920 transitions. Word has length 61 [2019-12-18 16:32:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:50,542 INFO L462 AbstractCegarLoop]: Abstraction has 7877 states and 18920 transitions. [2019-12-18 16:32:50,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:32:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 18920 transitions. [2019-12-18 16:32:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 16:32:50,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:50,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:50,557 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:50,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:50,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1644291991, now seen corresponding path program 1 times [2019-12-18 16:32:50,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:50,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411240] [2019-12-18 16:32:50,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:50,669 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-18 16:32:50,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411240] [2019-12-18 16:32:50,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:50,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:50,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354639186] [2019-12-18 16:32:50,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:32:50,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:50,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:32:50,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:32:50,672 INFO L87 Difference]: Start difference. First operand 7877 states and 18920 transitions. Second operand 4 states. [2019-12-18 16:32:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:50,728 INFO L93 Difference]: Finished difference Result 8687 states and 20596 transitions. [2019-12-18 16:32:50,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:32:50,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-18 16:32:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:50,731 INFO L225 Difference]: With dead ends: 8687 [2019-12-18 16:32:50,731 INFO L226 Difference]: Without dead ends: 897 [2019-12-18 16:32:50,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 16:32:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-12-18 16:32:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2019-12-18 16:32:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-12-18 16:32:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1808 transitions. [2019-12-18 16:32:50,748 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1808 transitions. Word has length 62 [2019-12-18 16:32:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:50,748 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1808 transitions. [2019-12-18 16:32:50,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:32:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1808 transitions. [2019-12-18 16:32:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 16:32:50,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:50,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:50,751 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:50,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:50,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1007960676, now seen corresponding path program 1 times [2019-12-18 16:32:50,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:50,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775482704] [2019-12-18 16:32:50,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:50,873 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-18 16:32:50,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775482704] [2019-12-18 16:32:50,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:50,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:32:50,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526771649] [2019-12-18 16:32:50,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:32:50,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:32:50,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:32:50,879 INFO L87 Difference]: Start difference. First operand 897 states and 1808 transitions. Second operand 7 states. [2019-12-18 16:32:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:51,053 INFO L93 Difference]: Finished difference Result 1620 states and 3241 transitions. [2019-12-18 16:32:51,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:32:51,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-18 16:32:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:51,055 INFO L225 Difference]: With dead ends: 1620 [2019-12-18 16:32:51,055 INFO L226 Difference]: Without dead ends: 1172 [2019-12-18 16:32:51,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:32:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-12-18 16:32:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 950. [2019-12-18 16:32:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-18 16:32:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1900 transitions. [2019-12-18 16:32:51,068 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1900 transitions. Word has length 62 [2019-12-18 16:32:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:51,069 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1900 transitions. [2019-12-18 16:32:51,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:32:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1900 transitions. [2019-12-18 16:32:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 16:32:51,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:51,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:51,071 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:51,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1552326044, now seen corresponding path program 2 times [2019-12-18 16:32:51,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:51,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924746932] [2019-12-18 16:32:51,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:51,221 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-18 16:32:51,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924746932] [2019-12-18 16:32:51,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:51,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:32:51,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470901058] [2019-12-18 16:32:51,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:32:51,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:51,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:32:51,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:32:51,223 INFO L87 Difference]: Start difference. First operand 950 states and 1900 transitions. Second operand 8 states. [2019-12-18 16:32:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:51,796 INFO L93 Difference]: Finished difference Result 1514 states and 2926 transitions. [2019-12-18 16:32:51,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:32:51,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-18 16:32:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:51,799 INFO L225 Difference]: With dead ends: 1514 [2019-12-18 16:32:51,799 INFO L226 Difference]: Without dead ends: 1514 [2019-12-18 16:32:51,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:32:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-12-18 16:32:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 988. [2019-12-18 16:32:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-12-18 16:32:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1964 transitions. [2019-12-18 16:32:51,811 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1964 transitions. Word has length 62 [2019-12-18 16:32:51,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:51,812 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 1964 transitions. [2019-12-18 16:32:51,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:32:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1964 transitions. [2019-12-18 16:32:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 16:32:51,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:51,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:51,813 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:51,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1744889270, now seen corresponding path program 3 times [2019-12-18 16:32:51,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:51,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375884197] [2019-12-18 16:32:51,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:51,903 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-18 16:32:51,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375884197] [2019-12-18 16:32:51,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:51,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:32:51,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074217982] [2019-12-18 16:32:51,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:32:51,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:51,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:32:51,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:32:51,905 INFO L87 Difference]: Start difference. First operand 988 states and 1964 transitions. Second operand 8 states. [2019-12-18 16:32:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:52,143 INFO L93 Difference]: Finished difference Result 1471 states and 2809 transitions. [2019-12-18 16:32:52,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:32:52,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-18 16:32:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:52,145 INFO L225 Difference]: With dead ends: 1471 [2019-12-18 16:32:52,145 INFO L226 Difference]: Without dead ends: 1301 [2019-12-18 16:32:52,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:32:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2019-12-18 16:32:52,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 984. [2019-12-18 16:32:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-12-18 16:32:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1956 transitions. [2019-12-18 16:32:52,161 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1956 transitions. Word has length 62 [2019-12-18 16:32:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:52,162 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1956 transitions. [2019-12-18 16:32:52,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:32:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1956 transitions. [2019-12-18 16:32:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 16:32:52,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:52,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:52,164 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:52,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2036190378, now seen corresponding path program 4 times [2019-12-18 16:32:52,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:52,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571652261] [2019-12-18 16:32:52,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:52,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-18 16:32:52,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571652261] [2019-12-18 16:32:52,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:52,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:32:52,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609292097] [2019-12-18 16:32:52,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:32:52,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:52,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:32:52,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:32:52,245 INFO L87 Difference]: Start difference. First operand 984 states and 1956 transitions. Second operand 6 states. [2019-12-18 16:32:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:52,669 INFO L93 Difference]: Finished difference Result 1193 states and 2325 transitions. [2019-12-18 16:32:52,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:32:52,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-18 16:32:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:52,672 INFO L225 Difference]: With dead ends: 1193 [2019-12-18 16:32:52,672 INFO L226 Difference]: Without dead ends: 1193 [2019-12-18 16:32:52,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:32:52,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-18 16:32:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1014. [2019-12-18 16:32:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-18 16:32:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2011 transitions. [2019-12-18 16:32:52,685 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2011 transitions. Word has length 62 [2019-12-18 16:32:52,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:52,685 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 2011 transitions. [2019-12-18 16:32:52,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:32:52,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2011 transitions. [2019-12-18 16:32:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 16:32:52,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:52,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:52,687 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:52,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:52,687 INFO L82 PathProgramCache]: Analyzing trace with hash 229898378, now seen corresponding path program 5 times [2019-12-18 16:32:52,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:52,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632827991] [2019-12-18 16:32:52,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:52,744 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-18 16:32:52,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632827991] [2019-12-18 16:32:52,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:52,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:32:52,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117325614] [2019-12-18 16:32:52,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:32:52,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:52,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:32:52,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:32:52,746 INFO L87 Difference]: Start difference. First operand 1014 states and 2011 transitions. Second operand 3 states. [2019-12-18 16:32:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:52,759 INFO L93 Difference]: Finished difference Result 1014 states and 2010 transitions. [2019-12-18 16:32:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:32:52,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-18 16:32:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:52,761 INFO L225 Difference]: With dead ends: 1014 [2019-12-18 16:32:52,761 INFO L226 Difference]: Without dead ends: 1014 [2019-12-18 16:32:52,761 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-18 16:32:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-12-18 16:32:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 870. [2019-12-18 16:32:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-12-18 16:32:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1745 transitions. [2019-12-18 16:32:52,773 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1745 transitions. Word has length 62 [2019-12-18 16:32:52,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:52,773 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 1745 transitions. [2019-12-18 16:32:52,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:32:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1745 transitions. [2019-12-18 16:32:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:32:52,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:52,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:52,775 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:52,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:52,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1358707696, now seen corresponding path program 1 times [2019-12-18 16:32:52,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:52,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956024758] [2019-12-18 16:32:52,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:32:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:32:52,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:32:52,925 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:32:52,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~weak$$choice2~0_331 0) (= v_~y$mem_tmp~0_262 0) (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t430~0.base_35| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t430~0.base_35|) |v_ULTIMATE.start_main_~#t430~0.offset_24| 0)) |v_#memory_int_19|) (= v_~y$w_buff1_used~0_559 0) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd0~0_210 0) (= v_~y$read_delayed~0_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$w_buff1~0_273 0) (= 0 v_~y$w_buff0~0_396) (= v_~y$flush_delayed~0_331 0) (= v_~y$r_buff1_thd1~0_223 0) (= 0 v_~y$r_buff0_thd2~0_420) (= 0 v_~__unbuffered_p1_EAX~0_45) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t430~0.base_35| 4) |v_#length_23|) (= 0 v_~weak$$choice0~0_251) (= v_~y$r_buff1_thd0~0_289 0) (= v_~__unbuffered_cnt~0_185 0) (= v_~y$w_buff0_used~0_892 0) (= v_~y$r_buff0_thd1~0_153 0) (= 0 |v_#NULL.base_6|) (= v_~x~0_52 0) (= v_~main$tmp_guard1~0_36 0) (= v_~y~0_382 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t430~0.base_35|) (= 0 v_~y$r_buff0_thd3~0_625) (= 0 v_~y$r_buff1_thd3~0_388) (= 0 v_~y$read_delayed_var~0.base_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t430~0.base_35|) 0) (= v_~z~0_29 0) (= 0 v_~y$r_buff1_thd2~0_385) (= v_~__unbuffered_p2_EBX~0_39 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t430~0.base_35| 1)) (= 0 |v_ULTIMATE.start_main_~#t430~0.offset_24|) (= 0 v_~__unbuffered_p0_EAX~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t432~0.base=|v_ULTIMATE.start_main_~#t432~0.base_18|, ~y$mem_tmp~0=v_~y$mem_tmp~0_262, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_388, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_331, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_39, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_66|, ULTIMATE.start_main_~#t430~0.offset=|v_ULTIMATE.start_main_~#t430~0.offset_24|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_72|, ~weak$$choice0~0=v_~weak$$choice0~0_251, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_196|, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_420, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_185, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_289, ~x~0=v_~x~0_52, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_892, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t431~0.base=|v_ULTIMATE.start_main_~#t431~0.base_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_223, ~y$w_buff0~0=v_~y$w_buff0~0_396, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_625, ULTIMATE.start_main_~#t431~0.offset=|v_ULTIMATE.start_main_~#t431~0.offset_22|, ~y~0=v_~y~0_382, ULTIMATE.start_main_~#t430~0.base=|v_ULTIMATE.start_main_~#t430~0.base_35|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_99|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_385, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_~#t432~0.offset=|v_ULTIMATE.start_main_~#t432~0.offset_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_210, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_331, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ULTIMATE.start_main_~#t432~0.base, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t430~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t431~0.base, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t431~0.offset, ~y~0, ULTIMATE.start_main_~#t430~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t432~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:32:52,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L830-1-->L832: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t431~0.offset_10|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t431~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t431~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t431~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t431~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t431~0.base_11|) |v_ULTIMATE.start_main_~#t431~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t431~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t431~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t431~0.base=|v_ULTIMATE.start_main_~#t431~0.base_11|, ULTIMATE.start_main_~#t431~0.offset=|v_ULTIMATE.start_main_~#t431~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t431~0.base, ULTIMATE.start_main_~#t431~0.offset, #length] because there is no mapped edge [2019-12-18 16:32:52,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-1-->L834: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t432~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t432~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t432~0.base_13|) |v_ULTIMATE.start_main_~#t432~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t432~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t432~0.offset_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t432~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t432~0.base_13| 0)) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t432~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t432~0.base=|v_ULTIMATE.start_main_~#t432~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t432~0.offset=|v_ULTIMATE.start_main_~#t432~0.offset_11|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t432~0.base, ULTIMATE.start_main_~#t432~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-18 16:32:52,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_39|) (= v_~y$w_buff0_used~0_219 v_~y$w_buff1_used~0_122) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_39) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_39) (= 1 v_~y$w_buff0~0_91) (= (mod v_~y$w_buff1_used~0_122 256) 0) (= v_~y$w_buff0~0_92 v_~y$w_buff1~0_64) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_41 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_39|) (= v_~y$w_buff0_used~0_218 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_219, ~y$w_buff0~0=v_~y$w_buff0~0_92, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_39, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_64, ~y$w_buff0~0=v_~y$w_buff0~0_91, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_39, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_122} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:32:52,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L792-2-->L792-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1262260662 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1262260662 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out1262260662| ~y$w_buff0~0_In1262260662)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1262260662| ~y$w_buff1~0_In1262260662) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1262260662, ~y$w_buff1~0=~y$w_buff1~0_In1262260662, ~y$w_buff0~0=~y$w_buff0~0_In1262260662, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1262260662} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1262260662|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1262260662, ~y$w_buff1~0=~y$w_buff1~0_In1262260662, ~y$w_buff0~0=~y$w_buff0~0_In1262260662, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1262260662} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 16:32:52,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L792-4-->L793: Formula: (= v_~y~0_37 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-18 16:32:52,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L797-->L798: Formula: (and (= v_~y$r_buff0_thd3~0_101 v_~y$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_11|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_13|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:32:52,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In706145701 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out706145701| ~y$mem_tmp~0_In706145701) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out706145701| ~y~0_In706145701) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In706145701, ~y$flush_delayed~0=~y$flush_delayed~0_In706145701, ~y~0=~y~0_In706145701} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out706145701|, ~y$mem_tmp~0=~y$mem_tmp~0_In706145701, ~y$flush_delayed~0=~y$flush_delayed~0_In706145701, ~y~0=~y~0_In706145701} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 16:32:52,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= v_~z~0_15 1) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_36 v_~__unbuffered_p0_EAX~0_14)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 16:32:52,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In337477437 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out337477437| ~y$mem_tmp~0_In337477437)) (and .cse0 (= ~y~0_In337477437 |P1Thread1of1ForFork2_#t~ite25_Out337477437|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In337477437, ~y$flush_delayed~0=~y$flush_delayed~0_In337477437, ~y~0=~y~0_In337477437} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In337477437, ~y$flush_delayed~0=~y$flush_delayed~0_In337477437, ~y~0=~y~0_In337477437, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out337477437|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 16:32:52,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1809995858 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1809995858 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out-1809995858| ~y$w_buff0_used~0_In-1809995858)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out-1809995858| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1809995858, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1809995858} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1809995858, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1809995858, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1809995858|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 16:32:52,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1368461832 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1368461832 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1368461832 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1368461832 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out1368461832| ~y$w_buff1_used~0_In1368461832)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out1368461832| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1368461832, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1368461832, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1368461832, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1368461832} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1368461832, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1368461832, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1368461832, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1368461832|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1368461832} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 16:32:52,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L810-->L811: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1631643209 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1631643209 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In-1631643209 ~y$r_buff0_thd3~0_Out-1631643209) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd3~0_Out-1631643209 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1631643209, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1631643209} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1631643209, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1631643209, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1631643209|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 16:32:52,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In384316757 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In384316757 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In384316757 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In384316757 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out384316757|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In384316757 |P2Thread1of1ForFork0_#t~ite54_Out384316757|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In384316757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In384316757, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In384316757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In384316757} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In384316757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In384316757, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out384316757|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In384316757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In384316757} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 16:32:52,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= v_~y$r_buff1_thd3~0_213 |v_P2Thread1of1ForFork0_#t~ite54_40|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_213, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:32:52,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L763-2-->P1EXIT: Formula: (and (= v_~y~0_235 |v_P1Thread1of1ForFork2_#t~ite25_104|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1)) (= v_~y$flush_delayed~0_185 0) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_104|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_185, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~y~0=v_~y~0_235, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_103|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 16:32:52,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L838-->L840-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= 0 (mod v_~y$w_buff0_used~0_302 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 16:32:52,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L840-2-->L840-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1958341770 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-1958341770| |ULTIMATE.start_main_#t~ite58_Out-1958341770|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1958341770 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out-1958341770| ~y~0_In-1958341770) (or .cse0 .cse1) .cse2) (and (not .cse0) .cse2 (= ~y$w_buff1~0_In-1958341770 |ULTIMATE.start_main_#t~ite58_Out-1958341770|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1958341770, ~y~0=~y~0_In-1958341770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1958341770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1958341770} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1958341770, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1958341770|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1958341770|, ~y~0=~y~0_In-1958341770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1958341770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1958341770} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 16:32:52,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In366667310 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In366667310 256)))) (or (and (= ~y$w_buff0_used~0_In366667310 |ULTIMATE.start_main_#t~ite60_Out366667310|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out366667310|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In366667310, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In366667310} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out366667310|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In366667310, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In366667310} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 16:32:52,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1482752081 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1482752081 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1482752081 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1482752081 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1482752081| ~y$w_buff1_used~0_In1482752081) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite61_Out1482752081| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1482752081, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1482752081, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1482752081, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1482752081} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1482752081|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1482752081, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1482752081, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1482752081, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1482752081} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 16:32:52,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1853132693 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1853132693 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out1853132693|)) (and (= ~y$r_buff0_thd0~0_In1853132693 |ULTIMATE.start_main_#t~ite62_Out1853132693|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1853132693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1853132693} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1853132693|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1853132693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1853132693} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 16:32:52,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In59596928 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In59596928 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In59596928 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In59596928 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In59596928 |ULTIMATE.start_main_#t~ite63_Out59596928|)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out59596928|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In59596928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In59596928, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In59596928, ~y$w_buff1_used~0=~y$w_buff1_used~0_In59596928} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out59596928|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In59596928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In59596928, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In59596928, ~y$w_buff1_used~0=~y$w_buff1_used~0_In59596928} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 16:32:52,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~__unbuffered_p1_EAX~0_24) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p0_EAX~0_30) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p2_EAX~0_33) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~y$r_buff1_thd0~0_237 |v_ULTIMATE.start_main_#t~ite63_37|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:32:53,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:32:53 BasicIcfg [2019-12-18 16:32:53,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:32:53,126 INFO L168 Benchmark]: Toolchain (without parser) took 80477.47 ms. Allocated memory was 140.0 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 102.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 16:32:53,126 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory is still 121.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 16:32:53,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.39 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 157.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:53,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.77 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:53,128 INFO L168 Benchmark]: Boogie Preprocessor took 41.81 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:53,128 INFO L168 Benchmark]: RCFGBuilder took 907.08 ms. Allocated memory is still 204.5 MB. Free memory was 151.8 MB in the beginning and 96.7 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:53,129 INFO L168 Benchmark]: TraceAbstraction took 78654.11 ms. Allocated memory was 204.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 96.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 16:32:53,131 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.23 ms. Allocated memory is still 140.0 MB. Free memory is still 121.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 801.39 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 157.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.77 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.81 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 907.08 ms. Allocated memory is still 204.5 MB. Free memory was 151.8 MB in the beginning and 96.7 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78654.11 ms. Allocated memory was 204.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 96.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 195 ProgramPointsBefore, 111 ProgramPointsAfterwards, 241 TransitionsBefore, 134 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 27 ChoiceCompositions, 9672 VarBasedMoverChecksPositive, 313 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 317 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 147047 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t430, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L832] FCALL, FORK 0 pthread_create(&t431, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L834] FCALL, FORK 0 pthread_create(&t432, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 y$flush_delayed = weak$$choice2 [L791] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L792] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L793] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L793] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L794] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L794] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L795] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L795] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L796] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L798] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L800] 3 y = y$flush_delayed ? y$mem_tmp : y [L801] 3 y$flush_delayed = (_Bool)0 [L804] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L748] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L755] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L755] 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) [L756] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L756] 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)) [L757] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L757] 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)) [L758] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L758] 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)) [L759] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L759] 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)) [L760] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L760] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L761] 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)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L807] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L808] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L809] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 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 [L843] 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 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 78.2s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4693 SDtfs, 5339 SDslu, 8672 SDs, 0 SdLazy, 3229 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121558occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 94200 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 909 NumberOfCodeBlocks, 909 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 824 ConstructedInterpolants, 0 QuantifiedInterpolants, 113162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...