/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix039_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:07:23,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:07:23,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:07:23,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:07:23,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:07:23,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:07:23,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:07:23,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:07:23,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:07:23,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:07:23,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:07:23,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:07:23,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:07:23,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:07:23,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:07:23,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:07:23,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:07:23,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:07:23,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:07:23,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:07:23,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:07:23,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:07:23,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:07:23,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:07:23,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:07:23,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:07:23,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:07:23,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:07:23,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:07:23,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:07:23,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:07:23,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:07:23,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:07:23,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:07:23,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:07:23,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:07:23,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:07:23,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:07:23,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:07:23,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:07:23,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:07:23,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:07:23,566 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:07:23,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:07:23,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:07:23,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:07:23,567 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:07:23,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:07:23,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:07:23,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:07:23,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:07:23,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:07:23,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:07:23,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:07:23,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:07:23,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:07:23,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:07:23,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:07:23,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:07:23,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:07:23,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:07:23,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:07:23,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:07:23,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:07:23,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:07:23,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:07:23,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:07:23,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:07:23,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:07:23,572 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:07:23,572 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:07:23,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:07:23,573 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:07:23,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:07:23,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:07:23,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:07:23,856 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:07:23,858 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:07:23,858 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:07:23,859 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_power.opt.i [2019-12-27 21:07:23,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8d504501/617091cebf474a2d8ed1d2717810ffec/FLAG6764d3b74 [2019-12-27 21:07:24,406 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:07:24,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_power.opt.i [2019-12-27 21:07:24,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8d504501/617091cebf474a2d8ed1d2717810ffec/FLAG6764d3b74 [2019-12-27 21:07:24,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8d504501/617091cebf474a2d8ed1d2717810ffec [2019-12-27 21:07:24,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:07:24,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:07:24,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:07:24,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:07:24,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:07:24,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:07:24" (1/1) ... [2019-12-27 21:07:24,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b0d5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:24, skipping insertion in model container [2019-12-27 21:07:24,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:07:24" (1/1) ... [2019-12-27 21:07:24,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:07:24,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:07:25,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:07:25,394 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:07:25,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:07:25,557 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:07:25,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25 WrapperNode [2019-12-27 21:07:25,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:07:25,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:07:25,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:07:25,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:07:25,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25" (1/1) ... [2019-12-27 21:07:25,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25" (1/1) ... [2019-12-27 21:07:25,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:07:25,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:07:25,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:07:25,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:07:25,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25" (1/1) ... [2019-12-27 21:07:25,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25" (1/1) ... [2019-12-27 21:07:25,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25" (1/1) ... [2019-12-27 21:07:25,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25" (1/1) ... [2019-12-27 21:07:25,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25" (1/1) ... [2019-12-27 21:07:25,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25" (1/1) ... [2019-12-27 21:07:25,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25" (1/1) ... [2019-12-27 21:07:25,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:07:25,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:07:25,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:07:25,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:07:25,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:07:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:07:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:07:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:07:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:07:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:07:25,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:07:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:07:25,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:07:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:07:25,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:07:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:07:25,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:07:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:07:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:07:25,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:07:25,730 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:07:26,454 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:07:26,454 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:07:26,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:07:26 BoogieIcfgContainer [2019-12-27 21:07:26,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:07:26,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:07:26,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:07:26,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:07:26,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:07:24" (1/3) ... [2019-12-27 21:07:26,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33af081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:07:26, skipping insertion in model container [2019-12-27 21:07:26,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:07:25" (2/3) ... [2019-12-27 21:07:26,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33af081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:07:26, skipping insertion in model container [2019-12-27 21:07:26,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:07:26" (3/3) ... [2019-12-27 21:07:26,464 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_power.opt.i [2019-12-27 21:07:26,475 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:07:26,475 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:07:26,486 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:07:26,486 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:07:26,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,527 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,528 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,530 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,571 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,571 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,571 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,572 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,572 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,581 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,581 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,586 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,587 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,592 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,592 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,593 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,593 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,593 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,593 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,594 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,594 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,594 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,594 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,594 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,594 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:07:26,613 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:07:26,633 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:07:26,633 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:07:26,633 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:07:26,633 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:07:26,634 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:07:26,634 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:07:26,634 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:07:26,634 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:07:26,651 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 21:07:26,653 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 21:07:26,748 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 21:07:26,748 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:07:26,762 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:07:26,781 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 21:07:26,830 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 21:07:26,830 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:07:26,837 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:07:26,854 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 21:07:26,855 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:07:30,889 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 21:07:31,060 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 21:07:31,077 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45931 [2019-12-27 21:07:31,078 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 21:07:31,081 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 79 transitions [2019-12-27 21:07:32,355 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22190 states. [2019-12-27 21:07:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 22190 states. [2019-12-27 21:07:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:07:32,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:32,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:32,364 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:32,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:32,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1275249875, now seen corresponding path program 1 times [2019-12-27 21:07:32,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:32,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507476397] [2019-12-27 21:07:32,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:32,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507476397] [2019-12-27 21:07:32,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:32,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:07:32,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1850187453] [2019-12-27 21:07:32,648 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:32,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:32,679 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:07:32,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:32,683 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:32,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:07:32,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:32,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:07:32,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:32,700 INFO L87 Difference]: Start difference. First operand 22190 states. Second operand 3 states. [2019-12-27 21:07:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:34,030 INFO L93 Difference]: Finished difference Result 21750 states and 93576 transitions. [2019-12-27 21:07:34,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:07:34,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:07:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:34,293 INFO L225 Difference]: With dead ends: 21750 [2019-12-27 21:07:34,293 INFO L226 Difference]: Without dead ends: 20406 [2019-12-27 21:07:34,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:34,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20406 states. [2019-12-27 21:07:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20406 to 20406. [2019-12-27 21:07:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 21:07:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 87656 transitions. [2019-12-27 21:07:35,377 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 87656 transitions. Word has length 9 [2019-12-27 21:07:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:35,378 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 87656 transitions. [2019-12-27 21:07:35,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:07:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 87656 transitions. [2019-12-27 21:07:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:07:35,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:35,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:35,386 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:35,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1986305756, now seen corresponding path program 1 times [2019-12-27 21:07:35,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:35,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923257270] [2019-12-27 21:07:35,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:35,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923257270] [2019-12-27 21:07:35,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:35,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:07:35,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902807240] [2019-12-27 21:07:35,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:35,498 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:35,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:07:35,504 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:35,504 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:35,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:07:35,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:35,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:07:35,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:07:35,507 INFO L87 Difference]: Start difference. First operand 20406 states and 87656 transitions. Second operand 4 states. [2019-12-27 21:07:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:36,348 INFO L93 Difference]: Finished difference Result 31694 states and 131120 transitions. [2019-12-27 21:07:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:07:36,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 21:07:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:36,504 INFO L225 Difference]: With dead ends: 31694 [2019-12-27 21:07:36,504 INFO L226 Difference]: Without dead ends: 31634 [2019-12-27 21:07:36,505 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-27 21:07:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31634 states. [2019-12-27 21:07:38,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31634 to 28582. [2019-12-27 21:07:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28582 states. [2019-12-27 21:07:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28582 states to 28582 states and 119644 transitions. [2019-12-27 21:07:39,249 INFO L78 Accepts]: Start accepts. Automaton has 28582 states and 119644 transitions. Word has length 15 [2019-12-27 21:07:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:39,250 INFO L462 AbstractCegarLoop]: Abstraction has 28582 states and 119644 transitions. [2019-12-27 21:07:39,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:07:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 28582 states and 119644 transitions. [2019-12-27 21:07:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:07:39,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:39,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:39,257 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:39,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2051676058, now seen corresponding path program 1 times [2019-12-27 21:07:39,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:39,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659432511] [2019-12-27 21:07:39,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:39,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659432511] [2019-12-27 21:07:39,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:39,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:07:39,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [278106061] [2019-12-27 21:07:39,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:39,355 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:39,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:07:39,362 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:39,398 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:07:39,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:07:39,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:39,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:07:39,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:07:39,399 INFO L87 Difference]: Start difference. First operand 28582 states and 119644 transitions. Second operand 5 states. [2019-12-27 21:07:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:39,759 INFO L93 Difference]: Finished difference Result 35982 states and 149300 transitions. [2019-12-27 21:07:39,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:07:39,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:07:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:39,927 INFO L225 Difference]: With dead ends: 35982 [2019-12-27 21:07:39,928 INFO L226 Difference]: Without dead ends: 35934 [2019-12-27 21:07:39,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:07:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35934 states. [2019-12-27 21:07:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35934 to 31130. [2019-12-27 21:07:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31130 states. [2019-12-27 21:07:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31130 states to 31130 states and 130164 transitions. [2019-12-27 21:07:43,477 INFO L78 Accepts]: Start accepts. Automaton has 31130 states and 130164 transitions. Word has length 18 [2019-12-27 21:07:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:43,477 INFO L462 AbstractCegarLoop]: Abstraction has 31130 states and 130164 transitions. [2019-12-27 21:07:43,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:07:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 31130 states and 130164 transitions. [2019-12-27 21:07:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 21:07:43,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:43,493 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] [2019-12-27 21:07:43,493 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash 94366494, now seen corresponding path program 1 times [2019-12-27 21:07:43,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:43,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126589446] [2019-12-27 21:07:43,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:43,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126589446] [2019-12-27 21:07:43,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:43,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:07:43,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520699255] [2019-12-27 21:07:43,594 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:43,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:43,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 22 transitions. [2019-12-27 21:07:43,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:43,600 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:43,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:07:43,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:43,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:07:43,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:43,601 INFO L87 Difference]: Start difference. First operand 31130 states and 130164 transitions. Second operand 3 states. [2019-12-27 21:07:43,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:43,744 INFO L93 Difference]: Finished difference Result 30694 states and 128328 transitions. [2019-12-27 21:07:43,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:07:43,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 21:07:43,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:43,873 INFO L225 Difference]: With dead ends: 30694 [2019-12-27 21:07:43,873 INFO L226 Difference]: Without dead ends: 30694 [2019-12-27 21:07:43,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30694 states. [2019-12-27 21:07:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30694 to 30694. [2019-12-27 21:07:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30694 states. [2019-12-27 21:07:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30694 states to 30694 states and 128328 transitions. [2019-12-27 21:07:45,004 INFO L78 Accepts]: Start accepts. Automaton has 30694 states and 128328 transitions. Word has length 20 [2019-12-27 21:07:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:45,004 INFO L462 AbstractCegarLoop]: Abstraction has 30694 states and 128328 transitions. [2019-12-27 21:07:45,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:07:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 30694 states and 128328 transitions. [2019-12-27 21:07:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 21:07:45,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:45,019 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] [2019-12-27 21:07:45,019 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:45,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash 831760779, now seen corresponding path program 1 times [2019-12-27 21:07:45,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:45,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525530540] [2019-12-27 21:07:45,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:45,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525530540] [2019-12-27 21:07:45,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:45,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:07:45,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102217143] [2019-12-27 21:07:45,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:45,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:45,090 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 33 transitions. [2019-12-27 21:07:45,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:45,091 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:45,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:07:45,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:07:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:45,092 INFO L87 Difference]: Start difference. First operand 30694 states and 128328 transitions. Second operand 3 states. [2019-12-27 21:07:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:45,605 INFO L93 Difference]: Finished difference Result 30650 states and 128132 transitions. [2019-12-27 21:07:45,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:07:45,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 21:07:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:45,716 INFO L225 Difference]: With dead ends: 30650 [2019-12-27 21:07:45,716 INFO L226 Difference]: Without dead ends: 30650 [2019-12-27 21:07:45,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30650 states. [2019-12-27 21:07:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30650 to 30650. [2019-12-27 21:07:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30650 states. [2019-12-27 21:07:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30650 states to 30650 states and 128132 transitions. [2019-12-27 21:07:48,600 INFO L78 Accepts]: Start accepts. Automaton has 30650 states and 128132 transitions. Word has length 21 [2019-12-27 21:07:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:48,601 INFO L462 AbstractCegarLoop]: Abstraction has 30650 states and 128132 transitions. [2019-12-27 21:07:48,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:07:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 30650 states and 128132 transitions. [2019-12-27 21:07:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:07:48,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:48,613 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-27 21:07:48,613 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:48,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:48,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1462742231, now seen corresponding path program 1 times [2019-12-27 21:07:48,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:48,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222032526] [2019-12-27 21:07:48,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:48,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222032526] [2019-12-27 21:07:48,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:48,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:07:48,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [795030927] [2019-12-27 21:07:48,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:48,667 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:48,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 46 transitions. [2019-12-27 21:07:48,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:48,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:48,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:07:48,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:48,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:07:48,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:48,676 INFO L87 Difference]: Start difference. First operand 30650 states and 128132 transitions. Second operand 3 states. [2019-12-27 21:07:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:48,946 INFO L93 Difference]: Finished difference Result 45416 states and 181621 transitions. [2019-12-27 21:07:48,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:07:48,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 21:07:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:49,043 INFO L225 Difference]: With dead ends: 45416 [2019-12-27 21:07:49,043 INFO L226 Difference]: Without dead ends: 32472 [2019-12-27 21:07:49,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32472 states. [2019-12-27 21:07:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32472 to 31184. [2019-12-27 21:07:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31184 states. [2019-12-27 21:07:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31184 states to 31184 states and 116749 transitions. [2019-12-27 21:07:50,000 INFO L78 Accepts]: Start accepts. Automaton has 31184 states and 116749 transitions. Word has length 22 [2019-12-27 21:07:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:50,000 INFO L462 AbstractCegarLoop]: Abstraction has 31184 states and 116749 transitions. [2019-12-27 21:07:50,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:07:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 31184 states and 116749 transitions. [2019-12-27 21:07:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:07:50,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:50,017 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-27 21:07:50,017 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:50,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:50,017 INFO L82 PathProgramCache]: Analyzing trace with hash 469546711, now seen corresponding path program 1 times [2019-12-27 21:07:50,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:50,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807590681] [2019-12-27 21:07:50,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:50,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807590681] [2019-12-27 21:07:50,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:50,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:07:50,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1540115875] [2019-12-27 21:07:50,100 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:50,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:50,110 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 55 transitions. [2019-12-27 21:07:50,110 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:50,118 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:07:50,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:07:50,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:50,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:07:50,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:07:50,120 INFO L87 Difference]: Start difference. First operand 31184 states and 116749 transitions. Second operand 4 states. [2019-12-27 21:07:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:50,358 INFO L93 Difference]: Finished difference Result 31184 states and 115357 transitions. [2019-12-27 21:07:50,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:07:50,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-27 21:07:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:50,430 INFO L225 Difference]: With dead ends: 31184 [2019-12-27 21:07:50,431 INFO L226 Difference]: Without dead ends: 31184 [2019-12-27 21:07:50,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:07:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31184 states. [2019-12-27 21:07:51,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31184 to 30784. [2019-12-27 21:07:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30784 states. [2019-12-27 21:07:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30784 states to 30784 states and 113997 transitions. [2019-12-27 21:07:51,318 INFO L78 Accepts]: Start accepts. Automaton has 30784 states and 113997 transitions. Word has length 22 [2019-12-27 21:07:51,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:51,319 INFO L462 AbstractCegarLoop]: Abstraction has 30784 states and 113997 transitions. [2019-12-27 21:07:51,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:07:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 30784 states and 113997 transitions. [2019-12-27 21:07:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 21:07:51,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:51,331 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] [2019-12-27 21:07:51,331 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1201021632, now seen corresponding path program 1 times [2019-12-27 21:07:51,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:51,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846486380] [2019-12-27 21:07:51,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:51,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846486380] [2019-12-27 21:07:51,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:51,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:07:51,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [352840436] [2019-12-27 21:07:51,399 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:51,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:51,409 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 52 transitions. [2019-12-27 21:07:51,409 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:51,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:07:51,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:07:51,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:07:51,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:07:51,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:07:51,456 INFO L87 Difference]: Start difference. First operand 30784 states and 113997 transitions. Second operand 7 states. [2019-12-27 21:07:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:51,915 INFO L93 Difference]: Finished difference Result 42057 states and 147642 transitions. [2019-12-27 21:07:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:07:51,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 21:07:51,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:52,012 INFO L225 Difference]: With dead ends: 42057 [2019-12-27 21:07:52,013 INFO L226 Difference]: Without dead ends: 40219 [2019-12-27 21:07:52,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:07:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40219 states. [2019-12-27 21:07:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40219 to 24465. [2019-12-27 21:07:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24465 states. [2019-12-27 21:07:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24465 states to 24465 states and 85880 transitions. [2019-12-27 21:07:52,913 INFO L78 Accepts]: Start accepts. Automaton has 24465 states and 85880 transitions. Word has length 23 [2019-12-27 21:07:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:52,914 INFO L462 AbstractCegarLoop]: Abstraction has 24465 states and 85880 transitions. [2019-12-27 21:07:52,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:07:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 24465 states and 85880 transitions. [2019-12-27 21:07:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 21:07:52,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:52,925 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] [2019-12-27 21:07:52,925 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1983808268, now seen corresponding path program 1 times [2019-12-27 21:07:52,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:52,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981230154] [2019-12-27 21:07:52,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:53,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981230154] [2019-12-27 21:07:53,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:53,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:07:53,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1209801368] [2019-12-27 21:07:53,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:53,019 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:53,028 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 74 transitions. [2019-12-27 21:07:53,028 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:53,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:07:53,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:07:53,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:07:53,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:53,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:07:53,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:07:53,076 INFO L87 Difference]: Start difference. First operand 24465 states and 85880 transitions. Second operand 8 states. [2019-12-27 21:07:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:53,478 INFO L93 Difference]: Finished difference Result 18339 states and 57126 transitions. [2019-12-27 21:07:53,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:07:53,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 21:07:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:53,503 INFO L225 Difference]: With dead ends: 18339 [2019-12-27 21:07:53,504 INFO L226 Difference]: Without dead ends: 16888 [2019-12-27 21:07:53,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:07:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16888 states. [2019-12-27 21:07:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16888 to 10902. [2019-12-27 21:07:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-12-27 21:07:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 33618 transitions. [2019-12-27 21:07:53,696 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 33618 transitions. Word has length 24 [2019-12-27 21:07:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:53,696 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 33618 transitions. [2019-12-27 21:07:53,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:07:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 33618 transitions. [2019-12-27 21:07:53,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:07:53,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:53,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:53,702 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:53,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:53,702 INFO L82 PathProgramCache]: Analyzing trace with hash 22545008, now seen corresponding path program 1 times [2019-12-27 21:07:53,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:53,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188780361] [2019-12-27 21:07:53,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:53,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188780361] [2019-12-27 21:07:53,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:53,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:07:53,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1176391638] [2019-12-27 21:07:53,744 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:53,748 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:53,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 92 transitions. [2019-12-27 21:07:53,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:53,781 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:07:53,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:07:53,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:53,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:07:53,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:07:53,782 INFO L87 Difference]: Start difference. First operand 10902 states and 33618 transitions. Second operand 5 states. [2019-12-27 21:07:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:53,867 INFO L93 Difference]: Finished difference Result 16450 states and 50656 transitions. [2019-12-27 21:07:53,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:07:53,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:07:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:53,879 INFO L225 Difference]: With dead ends: 16450 [2019-12-27 21:07:53,880 INFO L226 Difference]: Without dead ends: 8773 [2019-12-27 21:07:53,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:07:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-27 21:07:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 8484. [2019-12-27 21:07:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8484 states. [2019-12-27 21:07:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 26171 transitions. [2019-12-27 21:07:54,094 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 26171 transitions. Word has length 25 [2019-12-27 21:07:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:54,094 INFO L462 AbstractCegarLoop]: Abstraction has 8484 states and 26171 transitions. [2019-12-27 21:07:54,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:07:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 26171 transitions. [2019-12-27 21:07:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:07:54,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:54,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:54,098 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:54,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:54,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1039706542, now seen corresponding path program 2 times [2019-12-27 21:07:54,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:54,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353395266] [2019-12-27 21:07:54,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:54,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353395266] [2019-12-27 21:07:54,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:54,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:07:54,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [616347770] [2019-12-27 21:07:54,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:54,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:54,152 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 62 transitions. [2019-12-27 21:07:54,152 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:54,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:07:54,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:07:54,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:54,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:07:54,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:07:54,155 INFO L87 Difference]: Start difference. First operand 8484 states and 26171 transitions. Second operand 4 states. [2019-12-27 21:07:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:54,240 INFO L93 Difference]: Finished difference Result 12593 states and 38979 transitions. [2019-12-27 21:07:54,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:07:54,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 21:07:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:54,258 INFO L225 Difference]: With dead ends: 12593 [2019-12-27 21:07:54,258 INFO L226 Difference]: Without dead ends: 7913 [2019-12-27 21:07:54,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:07:54,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7913 states. [2019-12-27 21:07:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 7425. [2019-12-27 21:07:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7425 states. [2019-12-27 21:07:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 21851 transitions. [2019-12-27 21:07:54,440 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 21851 transitions. Word has length 25 [2019-12-27 21:07:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:54,440 INFO L462 AbstractCegarLoop]: Abstraction has 7425 states and 21851 transitions. [2019-12-27 21:07:54,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:07:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 21851 transitions. [2019-12-27 21:07:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:07:54,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:54,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:54,447 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1222398540, now seen corresponding path program 3 times [2019-12-27 21:07:54,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:54,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045832084] [2019-12-27 21:07:54,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:54,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045832084] [2019-12-27 21:07:54,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:54,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:07:54,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [254110508] [2019-12-27 21:07:54,538 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:54,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:54,550 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 42 transitions. [2019-12-27 21:07:54,550 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:54,553 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:07:54,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:07:54,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:54,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:07:54,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:07:54,555 INFO L87 Difference]: Start difference. First operand 7425 states and 21851 transitions. Second operand 6 states. [2019-12-27 21:07:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:54,641 INFO L93 Difference]: Finished difference Result 2984 states and 7748 transitions. [2019-12-27 21:07:54,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:07:54,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:07:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:54,647 INFO L225 Difference]: With dead ends: 2984 [2019-12-27 21:07:54,647 INFO L226 Difference]: Without dead ends: 2530 [2019-12-27 21:07:54,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-27 21:07:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-12-27 21:07:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2530. [2019-12-27 21:07:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2530 states. [2019-12-27 21:07:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 6428 transitions. [2019-12-27 21:07:54,685 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 6428 transitions. Word has length 25 [2019-12-27 21:07:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:54,685 INFO L462 AbstractCegarLoop]: Abstraction has 2530 states and 6428 transitions. [2019-12-27 21:07:54,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:07:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 6428 transitions. [2019-12-27 21:07:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:07:54,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:54,691 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] [2019-12-27 21:07:54,691 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:54,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:54,692 INFO L82 PathProgramCache]: Analyzing trace with hash 923857396, now seen corresponding path program 1 times [2019-12-27 21:07:54,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:54,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200263186] [2019-12-27 21:07:54,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:54,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200263186] [2019-12-27 21:07:54,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:54,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:07:54,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2146939477] [2019-12-27 21:07:54,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:54,745 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:54,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 332 transitions. [2019-12-27 21:07:54,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:54,877 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:07:54,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:07:54,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:54,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:07:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:07:54,878 INFO L87 Difference]: Start difference. First operand 2530 states and 6428 transitions. Second operand 5 states. [2019-12-27 21:07:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:54,994 INFO L93 Difference]: Finished difference Result 3810 states and 9643 transitions. [2019-12-27 21:07:54,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:07:54,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 21:07:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:55,002 INFO L225 Difference]: With dead ends: 3810 [2019-12-27 21:07:55,002 INFO L226 Difference]: Without dead ends: 3810 [2019-12-27 21:07:55,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:07:55,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2019-12-27 21:07:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 2986. [2019-12-27 21:07:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2986 states. [2019-12-27 21:07:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 7669 transitions. [2019-12-27 21:07:55,064 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 7669 transitions. Word has length 32 [2019-12-27 21:07:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:55,064 INFO L462 AbstractCegarLoop]: Abstraction has 2986 states and 7669 transitions. [2019-12-27 21:07:55,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:07:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 7669 transitions. [2019-12-27 21:07:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:07:55,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:55,079 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] [2019-12-27 21:07:55,079 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash 386347120, now seen corresponding path program 1 times [2019-12-27 21:07:55,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:55,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880862592] [2019-12-27 21:07:55,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:55,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880862592] [2019-12-27 21:07:55,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:55,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:07:55,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [816028885] [2019-12-27 21:07:55,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:55,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:55,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 332 transitions. [2019-12-27 21:07:55,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:55,322 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:07:55,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:07:55,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:55,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:07:55,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:07:55,323 INFO L87 Difference]: Start difference. First operand 2986 states and 7669 transitions. Second operand 8 states. [2019-12-27 21:07:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:55,789 INFO L93 Difference]: Finished difference Result 5519 states and 13587 transitions. [2019-12-27 21:07:55,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:07:55,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 21:07:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:55,796 INFO L225 Difference]: With dead ends: 5519 [2019-12-27 21:07:55,796 INFO L226 Difference]: Without dead ends: 5336 [2019-12-27 21:07:55,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:07:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5336 states. [2019-12-27 21:07:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5336 to 3010. [2019-12-27 21:07:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3010 states. [2019-12-27 21:07:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 7675 transitions. [2019-12-27 21:07:55,837 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 7675 transitions. Word has length 32 [2019-12-27 21:07:55,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:55,838 INFO L462 AbstractCegarLoop]: Abstraction has 3010 states and 7675 transitions. [2019-12-27 21:07:55,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:07:55,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 7675 transitions. [2019-12-27 21:07:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:07:55,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:55,843 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] [2019-12-27 21:07:55,843 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:55,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:55,844 INFO L82 PathProgramCache]: Analyzing trace with hash 390952001, now seen corresponding path program 1 times [2019-12-27 21:07:55,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:55,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480746108] [2019-12-27 21:07:55,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:55,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480746108] [2019-12-27 21:07:55,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:55,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:07:55,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [307909697] [2019-12-27 21:07:55,926 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:55,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:55,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 353 transitions. [2019-12-27 21:07:55,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:56,135 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:07:56,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:07:56,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:56,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:07:56,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:07:56,138 INFO L87 Difference]: Start difference. First operand 3010 states and 7675 transitions. Second operand 8 states. [2019-12-27 21:07:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:56,567 INFO L93 Difference]: Finished difference Result 5442 states and 13173 transitions. [2019-12-27 21:07:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:07:56,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 21:07:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:56,573 INFO L225 Difference]: With dead ends: 5442 [2019-12-27 21:07:56,573 INFO L226 Difference]: Without dead ends: 5244 [2019-12-27 21:07:56,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:07:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2019-12-27 21:07:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 2895. [2019-12-27 21:07:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2019-12-27 21:07:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 7266 transitions. [2019-12-27 21:07:56,611 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 7266 transitions. Word has length 33 [2019-12-27 21:07:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:56,612 INFO L462 AbstractCegarLoop]: Abstraction has 2895 states and 7266 transitions. [2019-12-27 21:07:56,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:07:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 7266 transitions. [2019-12-27 21:07:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:07:56,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:56,615 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-27 21:07:56,615 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:56,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1721626467, now seen corresponding path program 1 times [2019-12-27 21:07:56,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:56,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562706236] [2019-12-27 21:07:56,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:56,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562706236] [2019-12-27 21:07:56,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:56,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:07:56,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1324230112] [2019-12-27 21:07:56,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:56,719 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:56,735 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 57 transitions. [2019-12-27 21:07:56,735 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:56,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:07:56,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:07:56,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:07:56,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:07:56,738 INFO L87 Difference]: Start difference. First operand 2895 states and 7266 transitions. Second operand 7 states. [2019-12-27 21:07:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:56,826 INFO L93 Difference]: Finished difference Result 2200 states and 5582 transitions. [2019-12-27 21:07:56,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:07:56,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 21:07:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:56,827 INFO L225 Difference]: With dead ends: 2200 [2019-12-27 21:07:56,827 INFO L226 Difference]: Without dead ends: 487 [2019-12-27 21:07:56,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:07:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-27 21:07:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2019-12-27 21:07:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-27 21:07:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1081 transitions. [2019-12-27 21:07:56,834 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1081 transitions. Word has length 34 [2019-12-27 21:07:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:56,834 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1081 transitions. [2019-12-27 21:07:56,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:07:56,835 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1081 transitions. [2019-12-27 21:07:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:07:56,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:56,836 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] [2019-12-27 21:07:56,836 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1659981285, now seen corresponding path program 1 times [2019-12-27 21:07:56,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:56,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383958579] [2019-12-27 21:07:56,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:56,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383958579] [2019-12-27 21:07:56,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:56,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:07:56,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1032090093] [2019-12-27 21:07:56,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:56,927 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:57,004 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 158 transitions. [2019-12-27 21:07:57,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:57,005 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:57,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:07:57,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:57,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:07:57,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:07:57,006 INFO L87 Difference]: Start difference. First operand 481 states and 1081 transitions. Second operand 7 states. [2019-12-27 21:07:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:57,182 INFO L93 Difference]: Finished difference Result 912 states and 2005 transitions. [2019-12-27 21:07:57,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:07:57,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 21:07:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:57,184 INFO L225 Difference]: With dead ends: 912 [2019-12-27 21:07:57,184 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 21:07:57,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:07:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 21:07:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 548. [2019-12-27 21:07:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-27 21:07:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1194 transitions. [2019-12-27 21:07:57,190 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1194 transitions. Word has length 48 [2019-12-27 21:07:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:57,190 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1194 transitions. [2019-12-27 21:07:57,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:07:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1194 transitions. [2019-12-27 21:07:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:07:57,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:57,192 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] [2019-12-27 21:07:57,192 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1305532347, now seen corresponding path program 2 times [2019-12-27 21:07:57,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:57,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583330318] [2019-12-27 21:07:57,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:07:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:07:57,319 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:07:57,320 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:07:57,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1029~0.base_29| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1029~0.base_29|) |v_ULTIMATE.start_main_~#t1029~0.offset_22| 0)) |v_#memory_int_25|) (= v_~b~0_13 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1029~0.base_29| 4)) (= 0 v_~z$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_25) (= v_~z$w_buff0_used~0_92 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_29|) 0) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~z$r_buff0_thd1~0_10 0) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= 0 |v_ULTIMATE.start_main_~#t1029~0.offset_22|) (= v_~y~0_17 0) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~z$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~__unbuffered_p0_EAX~0_14) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$w_buff0~0_24) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_29| 1)) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 v_~z$w_buff1_used~0_61) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1029~0.base_29|) (= 0 v_~__unbuffered_p3_EBX~0_15) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_66 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~z$r_buff1_thd3~0_43) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~x~0_12 0) (= v_~z~0_20 0) (= v_~z$r_buff0_thd0~0_23 0) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_18|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ULTIMATE.start_main_~#t1029~0.base=|v_ULTIMATE.start_main_~#t1029~0.base_29|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_19|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_12, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_15|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_23|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_19|, ~b~0=v_~b~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_20, ULTIMATE.start_main_~#t1029~0.offset=|v_ULTIMATE.start_main_~#t1029~0.offset_22|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1029~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1032~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1032~0.offset, ULTIMATE.start_main_~#t1030~0.base, #NULL.base, ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1031~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1029~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:07:57,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L843-1-->L845: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1030~0.base_11| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1030~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1030~0.offset_10| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11|) |v_ULTIMATE.start_main_~#t1030~0.offset_10| 1)) |v_#memory_int_19|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11| 1) |v_#valid_48|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1030~0.base] because there is no mapped edge [2019-12-27 21:07:57,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L845-1-->L847: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1031~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1031~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12|) |v_ULTIMATE.start_main_~#t1031~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1031~0.base_12| 4) |v_#length_21|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1031~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_11|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_~#t1031~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 21:07:57,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1032~0.base_12|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12|) |v_ULTIMATE.start_main_~#t1032~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1032~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t1032~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12|)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12| 1) |v_#valid_42|) (not (= 0 |v_ULTIMATE.start_main_~#t1032~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_12|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1032~0.base, #length, ULTIMATE.start_main_~#t1032~0.offset] because there is no mapped edge [2019-12-27 21:07:57,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L4-->L820: Formula: (and (= ~__unbuffered_p3_EAX~0_Out-470308056 ~a~0_Out-470308056) (= ~z$r_buff1_thd3~0_Out-470308056 ~z$r_buff0_thd3~0_In-470308056) (= ~z$r_buff0_thd1~0_In-470308056 ~z$r_buff1_thd1~0_Out-470308056) (= ~z$r_buff1_thd0~0_Out-470308056 ~z$r_buff0_thd0~0_In-470308056) (= ~z$r_buff0_thd2~0_In-470308056 ~z$r_buff1_thd2~0_Out-470308056) (= ~z$r_buff0_thd4~0_In-470308056 ~z$r_buff1_thd4~0_Out-470308056) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-470308056 0)) (= ~b~0_In-470308056 ~__unbuffered_p3_EBX~0_Out-470308056) (= 1 ~a~0_Out-470308056) (= ~z$r_buff0_thd4~0_Out-470308056 1)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-470308056, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-470308056, ~b~0=~b~0_In-470308056, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-470308056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-470308056, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-470308056, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-470308056} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-470308056, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-470308056, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-470308056, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-470308056, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-470308056, ~a~0=~a~0_Out-470308056, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-470308056, ~b~0=~b~0_In-470308056, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-470308056, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-470308056, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-470308056, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-470308056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-470308056, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-470308056, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-470308056} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:07:57,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= 1 v_~b~0_8) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_8) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~b~0=v_~b~0_8, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 21:07:57,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 1 v_~x~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 1 v_~y~0_8) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_8, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 21:07:57,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-566518751 256) 0))) (or (and (= ~z$w_buff0~0_In-566518751 |P2Thread1of1ForFork1_#t~ite9_Out-566518751|) (= |P2Thread1of1ForFork1_#t~ite8_In-566518751| |P2Thread1of1ForFork1_#t~ite8_Out-566518751|) (not .cse0)) (and (= ~z$w_buff0~0_In-566518751 |P2Thread1of1ForFork1_#t~ite8_Out-566518751|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-566518751 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-566518751 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-566518751 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-566518751 256))))) (= |P2Thread1of1ForFork1_#t~ite9_Out-566518751| |P2Thread1of1ForFork1_#t~ite8_Out-566518751|) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-566518751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-566518751, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-566518751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-566518751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-566518751, ~weak$$choice2~0=~weak$$choice2~0_In-566518751, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-566518751|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-566518751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-566518751, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-566518751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-566518751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-566518751, ~weak$$choice2~0=~weak$$choice2~0_In-566518751, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-566518751|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-566518751|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:07:57,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1640057887 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_In-1640057887| |P2Thread1of1ForFork1_#t~ite11_Out-1640057887|) (= ~z$w_buff1~0_In-1640057887 |P2Thread1of1ForFork1_#t~ite12_Out-1640057887|) (not .cse0)) (and (= ~z$w_buff1~0_In-1640057887 |P2Thread1of1ForFork1_#t~ite11_Out-1640057887|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1640057887 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1640057887 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1640057887 256) 0)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-1640057887 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite12_Out-1640057887| |P2Thread1of1ForFork1_#t~ite11_Out-1640057887|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1640057887, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1640057887, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-1640057887|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1640057887, ~z$w_buff1~0=~z$w_buff1~0_In-1640057887, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1640057887, ~weak$$choice2~0=~weak$$choice2~0_In-1640057887} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1640057887, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1640057887|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1640057887, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-1640057887|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1640057887, ~z$w_buff1~0=~z$w_buff1~0_In-1640057887, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1640057887, ~weak$$choice2~0=~weak$$choice2~0_In-1640057887} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:07:57,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-405797973 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_In-405797973| |P2Thread1of1ForFork1_#t~ite14_Out-405797973|) (not .cse0) (= ~z$w_buff0_used~0_In-405797973 |P2Thread1of1ForFork1_#t~ite15_Out-405797973|)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out-405797973| |P2Thread1of1ForFork1_#t~ite15_Out-405797973|) (= |P2Thread1of1ForFork1_#t~ite14_Out-405797973| ~z$w_buff0_used~0_In-405797973) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-405797973 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-405797973 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-405797973 256))) (and (= (mod ~z$r_buff1_thd3~0_In-405797973 256) 0) .cse1)))))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-405797973|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-405797973, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-405797973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-405797973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-405797973, ~weak$$choice2~0=~weak$$choice2~0_In-405797973} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-405797973|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-405797973|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-405797973, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-405797973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-405797973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-405797973, ~weak$$choice2~0=~weak$$choice2~0_In-405797973} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 21:07:57,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 21:07:57,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1435481758 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite24_Out-1435481758| ~z$r_buff1_thd3~0_In-1435481758) (= |P2Thread1of1ForFork1_#t~ite23_In-1435481758| |P2Thread1of1ForFork1_#t~ite23_Out-1435481758|) (not .cse0)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1435481758 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1435481758 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1435481758 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1435481758 256)))) (= ~z$r_buff1_thd3~0_In-1435481758 |P2Thread1of1ForFork1_#t~ite23_Out-1435481758|) (= |P2Thread1of1ForFork1_#t~ite24_Out-1435481758| |P2Thread1of1ForFork1_#t~ite23_Out-1435481758|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1435481758, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1435481758, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-1435481758|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1435481758, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1435481758, ~weak$$choice2~0=~weak$$choice2~0_In-1435481758} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-1435481758|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1435481758, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1435481758, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-1435481758|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1435481758, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1435481758, ~weak$$choice2~0=~weak$$choice2~0_In-1435481758} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 21:07:57,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_13 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:07:57,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1776998161 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1776998161 256)))) (or (and (= ~z$w_buff0_used~0_In-1776998161 |P3Thread1of1ForFork2_#t~ite28_Out-1776998161|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-1776998161|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1776998161, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1776998161} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1776998161|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1776998161, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1776998161} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 21:07:57,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-336578994 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-336578994 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-336578994 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-336578994 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-336578994 |P3Thread1of1ForFork2_#t~ite29_Out-336578994|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork2_#t~ite29_Out-336578994|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-336578994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-336578994, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-336578994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-336578994} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-336578994|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-336578994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-336578994, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-336578994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-336578994} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 21:07:57,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-132051117 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-132051117 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-132051117 ~z$r_buff0_thd4~0_In-132051117)) (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-132051117 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-132051117, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-132051117} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-132051117, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-132051117, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-132051117|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 21:07:57,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2105159459 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-2105159459 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2105159459 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-2105159459 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out-2105159459| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite31_Out-2105159459| ~z$r_buff1_thd4~0_In-2105159459) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2105159459, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2105159459, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2105159459, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2105159459} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2105159459, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2105159459, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2105159459, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2105159459, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-2105159459|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 21:07:57,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd4~0_16) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_8|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 21:07:57,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_63 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:07:57,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1934086171 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite37_Out-1934086171| |ULTIMATE.start_main_#t~ite36_Out-1934086171|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1934086171 256)))) (or (and (= ~z~0_In-1934086171 |ULTIMATE.start_main_#t~ite36_Out-1934086171|) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (= ~z$w_buff1~0_In-1934086171 |ULTIMATE.start_main_#t~ite36_Out-1934086171|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1934086171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1934086171, ~z$w_buff1~0=~z$w_buff1~0_In-1934086171, ~z~0=~z~0_In-1934086171} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1934086171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1934086171, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1934086171|, ~z$w_buff1~0=~z$w_buff1~0_In-1934086171, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1934086171|, ~z~0=~z~0_In-1934086171} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:07:57,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1949017266 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1949017266 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1949017266|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1949017266 |ULTIMATE.start_main_#t~ite38_Out1949017266|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1949017266, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1949017266} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1949017266, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1949017266, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1949017266|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:07:57,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1167846911 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1167846911 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1167846911 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1167846911 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1167846911| ~z$w_buff1_used~0_In-1167846911) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1167846911| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1167846911, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1167846911, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1167846911, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1167846911} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1167846911, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1167846911|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1167846911, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1167846911, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1167846911} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:07:57,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1757483371 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1757483371 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out1757483371|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1757483371| ~z$r_buff0_thd0~0_In1757483371) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1757483371, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1757483371} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1757483371, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1757483371|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1757483371} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:07:57,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-65995321 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-65995321 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-65995321 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-65995321 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-65995321| ~z$r_buff1_thd0~0_In-65995321) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite41_Out-65995321| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-65995321, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-65995321, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-65995321, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-65995321} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-65995321|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-65995321, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-65995321, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-65995321, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-65995321} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 21:07:57,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= 1 v_~__unbuffered_p3_EAX~0_10)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:07:57,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:07:57 BasicIcfg [2019-12-27 21:07:57,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:07:57,465 INFO L168 Benchmark]: Toolchain (without parser) took 32722.46 ms. Allocated memory was 145.8 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 101.9 MB in the beginning and 866.0 MB in the end (delta: -764.0 MB). Peak memory consumption was 791.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:07:57,466 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:07:57,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.11 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 156.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:07:57,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.48 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:07:57,469 INFO L168 Benchmark]: Boogie Preprocessor took 39.57 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:07:57,470 INFO L168 Benchmark]: RCFGBuilder took 794.50 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 105.0 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:07:57,473 INFO L168 Benchmark]: TraceAbstraction took 31001.90 ms. Allocated memory was 202.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 104.3 MB in the beginning and 866.0 MB in the end (delta: -761.7 MB). Peak memory consumption was 736.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:07:57,479 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 819.11 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 156.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.48 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.57 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 794.50 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 105.0 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31001.90 ms. Allocated memory was 202.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 104.3 MB in the beginning and 866.0 MB in the end (delta: -761.7 MB). Peak memory consumption was 736.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 170 ProgramPointsBefore, 75 ProgramPointsAfterwards, 192 TransitionsBefore, 79 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 23 ChoiceCompositions, 5608 VarBasedMoverChecksPositive, 130 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 45931 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1892 SDtfs, 3612 SDslu, 3345 SDs, 0 SdLazy, 1342 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31184occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 37624 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 33075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...