/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:27:12,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:27:12,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:27:12,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:27:12,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:27:12,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:27:12,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:27:12,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:27:12,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:27:12,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:27:12,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:27:12,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:27:12,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:27:12,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:27:12,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:27:12,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:27:12,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:27:12,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:27:12,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:27:12,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:27:12,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:27:12,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:27:12,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:27:12,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:27:12,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:27:12,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:27:12,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:27:12,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:27:12,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:27:12,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:27:12,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:27:12,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:27:12,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:27:12,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:27:12,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:27:12,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:27:12,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:27:12,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:27:12,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:27:12,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:27:12,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:27:12,487 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.epf [2019-12-18 21:27:12,508 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:27:12,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:27:12,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:27:12,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:27:12,510 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:27:12,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:27:12,510 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:27:12,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:27:12,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:27:12,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:27:12,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:27:12,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:27:12,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:27:12,512 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:27:12,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:27:12,512 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:27:12,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:27:12,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:27:12,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:27:12,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:27:12,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:27:12,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:27:12,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:27:12,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:27:12,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:27:12,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:27:12,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:27:12,514 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:27:12,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:27:12,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:27:12,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:27:12,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:27:12,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:27:12,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:27:12,843 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:27:12,844 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i [2019-12-18 21:27:12,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d043a5e/03a93c071a604530bd57344cf4fbe869/FLAGdef5a5cbd [2019-12-18 21:27:13,479 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:27:13,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i [2019-12-18 21:27:13,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d043a5e/03a93c071a604530bd57344cf4fbe869/FLAGdef5a5cbd [2019-12-18 21:27:13,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d043a5e/03a93c071a604530bd57344cf4fbe869 [2019-12-18 21:27:13,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:27:13,814 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:27:13,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:27:13,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:27:13,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:27:13,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:27:13" (1/1) ... [2019-12-18 21:27:13,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d81bf80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:13, skipping insertion in model container [2019-12-18 21:27:13,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:27:13" (1/1) ... [2019-12-18 21:27:13,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:27:13,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:27:14,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:27:14,468 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:27:14,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:27:14,636 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:27:14,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14 WrapperNode [2019-12-18 21:27:14,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:27:14,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:27:14,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:27:14,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:27:14,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14" (1/1) ... [2019-12-18 21:27:14,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14" (1/1) ... [2019-12-18 21:27:14,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:27:14,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:27:14,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:27:14,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:27:14,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14" (1/1) ... [2019-12-18 21:27:14,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14" (1/1) ... [2019-12-18 21:27:14,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14" (1/1) ... [2019-12-18 21:27:14,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14" (1/1) ... [2019-12-18 21:27:14,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14" (1/1) ... [2019-12-18 21:27:14,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14" (1/1) ... [2019-12-18 21:27:14,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14" (1/1) ... [2019-12-18 21:27:14,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:27:14,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:27:14,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:27:14,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:27:14,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:27:14,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:27:14,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:27:14,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:27:14,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:27:14,809 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:27:14,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:27:14,810 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:27:14,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:27:14,810 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:27:14,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:27:14,811 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:27:14,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:27:14,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:27:14,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:27:14,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:27:14,814 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:27:15,631 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:27:15,632 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:27:15,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:27:15 BoogieIcfgContainer [2019-12-18 21:27:15,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:27:15,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:27:15,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:27:15,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:27:15,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:27:13" (1/3) ... [2019-12-18 21:27:15,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f061228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:27:15, skipping insertion in model container [2019-12-18 21:27:15,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:27:14" (2/3) ... [2019-12-18 21:27:15,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f061228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:27:15, skipping insertion in model container [2019-12-18 21:27:15,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:27:15" (3/3) ... [2019-12-18 21:27:15,643 INFO L109 eAbstractionObserver]: Analyzing ICFG mix044_power.opt.i [2019-12-18 21:27:15,654 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:27:15,655 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:27:15,664 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:27:15,665 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:27:15,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,707 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,711 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,711 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,742 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,742 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,742 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,742 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,743 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,743 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,743 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,743 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,763 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,764 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,767 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,767 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,771 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,772 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:27:15,788 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:27:15,809 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:27:15,809 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:27:15,809 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:27:15,810 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:27:15,810 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:27:15,810 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:27:15,810 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:27:15,810 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:27:15,828 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 21:27:15,830 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 21:27:15,917 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 21:27:15,917 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:27:15,936 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:27:15,960 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 21:27:16,036 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 21:27:16,037 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:27:16,045 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:27:16,062 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:27:16,063 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:27:19,694 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 21:27:19,865 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 21:27:19,891 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-18 21:27:19,891 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 21:27:19,895 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-18 21:27:22,953 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-18 21:27:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-18 21:27:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:27:22,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:22,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:22,963 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:22,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-18 21:27:22,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:22,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249346328] [2019-12-18 21:27:22,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:23,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249346328] [2019-12-18 21:27:23,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:23,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:27:23,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699166205] [2019-12-18 21:27:23,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:27:23,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:27:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:23,310 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-18 21:27:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:24,221 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-18 21:27:24,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:27:24,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:27:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:24,641 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 21:27:24,641 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 21:27:24,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:25,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 21:27:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 21:27:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 21:27:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-18 21:27:26,794 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-18 21:27:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:26,796 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-18 21:27:26,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:27:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-18 21:27:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:27:26,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:26,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:26,810 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:26,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-18 21:27:26,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:26,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275540045] [2019-12-18 21:27:26,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:26,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275540045] [2019-12-18 21:27:26,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:26,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:27:26,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114446048] [2019-12-18 21:27:26,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:27:26,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:26,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:27:26,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:27:26,952 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 4 states. [2019-12-18 21:27:29,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:29,578 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-18 21:27:29,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:27:29,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:27:29,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:29,887 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 21:27:29,888 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 21:27:29,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:27:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 21:27:31,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-18 21:27:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-18 21:27:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-18 21:27:31,955 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-18 21:27:31,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:31,955 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-18 21:27:31,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:27:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-18 21:27:31,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:27:31,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:31,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:31,958 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-18 21:27:31,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:31,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600910377] [2019-12-18 21:27:31,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:32,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600910377] [2019-12-18 21:27:32,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:32,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:27:32,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685249617] [2019-12-18 21:27:32,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:27:32,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:32,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:27:32,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:32,008 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-18 21:27:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:33,771 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-18 21:27:33,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:27:33,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:27:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:34,007 INFO L225 Difference]: With dead ends: 39280 [2019-12-18 21:27:34,008 INFO L226 Difference]: Without dead ends: 39280 [2019-12-18 21:27:34,008 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-18 21:27:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-18 21:27:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-18 21:27:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-18 21:27:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-18 21:27:35,344 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-18 21:27:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:35,345 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-18 21:27:35,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:27:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-18 21:27:35,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:27:35,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:35,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:35,349 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:35,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:35,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-18 21:27:35,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:35,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832591718] [2019-12-18 21:27:35,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:35,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832591718] [2019-12-18 21:27:35,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:35,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:27:35,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932386567] [2019-12-18 21:27:35,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:27:35,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:35,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:27:35,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:27:35,405 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-18 21:27:35,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:35,491 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-18 21:27:35,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:27:35,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:27:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:35,522 INFO L225 Difference]: With dead ends: 16344 [2019-12-18 21:27:35,523 INFO L226 Difference]: Without dead ends: 16344 [2019-12-18 21:27:35,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:27:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-18 21:27:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-18 21:27:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-18 21:27:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-18 21:27:36,254 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-18 21:27:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:36,254 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-18 21:27:36,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:27:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-18 21:27:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:27:36,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:36,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:36,257 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:36,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:36,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-18 21:27:36,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:36,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530256931] [2019-12-18 21:27:36,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:36,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530256931] [2019-12-18 21:27:36,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:36,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:27:36,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108916823] [2019-12-18 21:27:36,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:27:36,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:27:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:27:36,352 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 5 states. [2019-12-18 21:27:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:36,396 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-18 21:27:36,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:27:36,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:27:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:36,400 INFO L225 Difference]: With dead ends: 2799 [2019-12-18 21:27:36,401 INFO L226 Difference]: Without dead ends: 2799 [2019-12-18 21:27:36,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:27:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-18 21:27:36,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-18 21:27:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-18 21:27:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-18 21:27:36,443 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-18 21:27:36,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:36,443 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-18 21:27:36,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:27:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-18 21:27:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:27:36,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:36,448 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] [2019-12-18 21:27:36,448 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:36,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-18 21:27:36,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:36,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726616290] [2019-12-18 21:27:36,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:36,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726616290] [2019-12-18 21:27:36,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:36,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:27:36,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570667338] [2019-12-18 21:27:36,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:27:36,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:36,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:27:36,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:27:36,529 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 6 states. [2019-12-18 21:27:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:36,579 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-18 21:27:36,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:27:36,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:27:36,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:36,582 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 21:27:36,582 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 21:27:36,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:27:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 21:27:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 21:27:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 21:27:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-18 21:27:36,603 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-18 21:27:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:36,603 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-18 21:27:36,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:27:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-18 21:27:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:27:36,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:36,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:36,608 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:36,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-18 21:27:36,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:36,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942752055] [2019-12-18 21:27:36,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:36,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942752055] [2019-12-18 21:27:36,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:36,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:27:36,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255579021] [2019-12-18 21:27:36,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:27:36,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:36,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:27:36,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:36,716 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-18 21:27:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:36,770 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-18 21:27:36,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:27:36,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:27:36,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:36,773 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 21:27:36,773 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 21:27:36,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 21:27:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 21:27:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 21:27:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-18 21:27:36,787 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-18 21:27:36,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:36,788 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-18 21:27:36,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:27:36,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-18 21:27:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:27:36,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:36,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:36,793 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-18 21:27:36,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:36,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151060069] [2019-12-18 21:27:36,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:36,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151060069] [2019-12-18 21:27:36,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:36,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:27:36,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648841767] [2019-12-18 21:27:36,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:27:36,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:36,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:27:36,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:27:36,917 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-18 21:27:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:37,138 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-18 21:27:37,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:27:37,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:27:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:37,142 INFO L225 Difference]: With dead ends: 1763 [2019-12-18 21:27:37,142 INFO L226 Difference]: Without dead ends: 1763 [2019-12-18 21:27:37,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:27:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-18 21:27:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-18 21:27:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-18 21:27:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-18 21:27:37,167 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-18 21:27:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:37,167 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-18 21:27:37,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:27:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-18 21:27:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:27:37,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:37,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:37,172 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:37,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:37,172 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-18 21:27:37,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:37,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177969307] [2019-12-18 21:27:37,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:37,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177969307] [2019-12-18 21:27:37,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:37,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:27:37,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496825965] [2019-12-18 21:27:37,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:27:37,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:37,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:27:37,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:27:37,312 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 6 states. [2019-12-18 21:27:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:37,726 INFO L93 Difference]: Finished difference Result 2369 states and 6739 transitions. [2019-12-18 21:27:37,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:27:37,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:27:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:37,731 INFO L225 Difference]: With dead ends: 2369 [2019-12-18 21:27:37,731 INFO L226 Difference]: Without dead ends: 2369 [2019-12-18 21:27:37,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:27:37,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-12-18 21:27:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1502. [2019-12-18 21:27:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-18 21:27:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-18 21:27:37,763 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-18 21:27:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:37,764 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-18 21:27:37,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:27:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-18 21:27:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:27:37,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:37,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:37,769 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:37,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:37,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-18 21:27:37,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:37,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494634453] [2019-12-18 21:27:37,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:37,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494634453] [2019-12-18 21:27:37,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:37,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:27:37,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842537430] [2019-12-18 21:27:37,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:27:37,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:37,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:27:37,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:27:37,908 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 6 states. [2019-12-18 21:27:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:38,297 INFO L93 Difference]: Finished difference Result 2376 states and 6757 transitions. [2019-12-18 21:27:38,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:27:38,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:27:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:38,305 INFO L225 Difference]: With dead ends: 2376 [2019-12-18 21:27:38,305 INFO L226 Difference]: Without dead ends: 2376 [2019-12-18 21:27:38,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:27:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-18 21:27:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1690. [2019-12-18 21:27:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-18 21:27:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4865 transitions. [2019-12-18 21:27:38,336 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4865 transitions. Word has length 58 [2019-12-18 21:27:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:38,337 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4865 transitions. [2019-12-18 21:27:38,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:27:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4865 transitions. [2019-12-18 21:27:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:27:38,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:38,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:38,341 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:38,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:38,342 INFO L82 PathProgramCache]: Analyzing trace with hash 361631606, now seen corresponding path program 4 times [2019-12-18 21:27:38,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:38,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511255842] [2019-12-18 21:27:38,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:38,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511255842] [2019-12-18 21:27:38,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:38,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:27:38,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534524538] [2019-12-18 21:27:38,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:27:38,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:38,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:27:38,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:27:38,448 INFO L87 Difference]: Start difference. First operand 1690 states and 4865 transitions. Second operand 7 states. [2019-12-18 21:27:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:39,004 INFO L93 Difference]: Finished difference Result 2633 states and 7491 transitions. [2019-12-18 21:27:39,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:27:39,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 21:27:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:39,009 INFO L225 Difference]: With dead ends: 2633 [2019-12-18 21:27:39,009 INFO L226 Difference]: Without dead ends: 2633 [2019-12-18 21:27:39,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:27:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2019-12-18 21:27:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 1606. [2019-12-18 21:27:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-12-18 21:27:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 4617 transitions. [2019-12-18 21:27:39,045 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 4617 transitions. Word has length 58 [2019-12-18 21:27:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:39,046 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 4617 transitions. [2019-12-18 21:27:39,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:27:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 4617 transitions. [2019-12-18 21:27:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:27:39,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:39,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:39,050 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:39,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:39,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1130563328, now seen corresponding path program 1 times [2019-12-18 21:27:39,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:39,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837964955] [2019-12-18 21:27:39,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:39,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837964955] [2019-12-18 21:27:39,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:39,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:27:39,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122307470] [2019-12-18 21:27:39,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:27:39,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:39,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:27:39,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:27:39,170 INFO L87 Difference]: Start difference. First operand 1606 states and 4617 transitions. Second operand 6 states. [2019-12-18 21:27:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:39,235 INFO L93 Difference]: Finished difference Result 2301 states and 6257 transitions. [2019-12-18 21:27:39,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:27:39,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 21:27:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:39,239 INFO L225 Difference]: With dead ends: 2301 [2019-12-18 21:27:39,239 INFO L226 Difference]: Without dead ends: 1476 [2019-12-18 21:27:39,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:27:39,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-12-18 21:27:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1476. [2019-12-18 21:27:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-12-18 21:27:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 4177 transitions. [2019-12-18 21:27:39,266 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 4177 transitions. Word has length 59 [2019-12-18 21:27:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:39,266 INFO L462 AbstractCegarLoop]: Abstraction has 1476 states and 4177 transitions. [2019-12-18 21:27:39,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:27:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 4177 transitions. [2019-12-18 21:27:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:27:39,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:39,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:39,271 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:39,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2124049444, now seen corresponding path program 2 times [2019-12-18 21:27:39,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:39,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520229738] [2019-12-18 21:27:39,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:39,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520229738] [2019-12-18 21:27:39,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:39,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:27:39,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817146467] [2019-12-18 21:27:39,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:27:39,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:39,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:27:39,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:27:39,431 INFO L87 Difference]: Start difference. First operand 1476 states and 4177 transitions. Second operand 6 states. [2019-12-18 21:27:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:39,514 INFO L93 Difference]: Finished difference Result 2100 states and 5644 transitions. [2019-12-18 21:27:39,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:27:39,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 21:27:39,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:39,517 INFO L225 Difference]: With dead ends: 2100 [2019-12-18 21:27:39,517 INFO L226 Difference]: Without dead ends: 1248 [2019-12-18 21:27:39,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:27:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-18 21:27:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1088. [2019-12-18 21:27:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-12-18 21:27:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2717 transitions. [2019-12-18 21:27:39,534 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2717 transitions. Word has length 59 [2019-12-18 21:27:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:39,534 INFO L462 AbstractCegarLoop]: Abstraction has 1088 states and 2717 transitions. [2019-12-18 21:27:39,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:27:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2717 transitions. [2019-12-18 21:27:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:27:39,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:39,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:39,537 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:39,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1600996218, now seen corresponding path program 3 times [2019-12-18 21:27:39,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:39,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200996525] [2019-12-18 21:27:39,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:39,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200996525] [2019-12-18 21:27:39,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:39,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:27:39,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395956847] [2019-12-18 21:27:39,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:27:39,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:27:39,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:27:39,767 INFO L87 Difference]: Start difference. First operand 1088 states and 2717 transitions. Second operand 12 states. [2019-12-18 21:27:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:41,104 INFO L93 Difference]: Finished difference Result 2855 states and 7115 transitions. [2019-12-18 21:27:41,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 21:27:41,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 21:27:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:41,105 INFO L225 Difference]: With dead ends: 2855 [2019-12-18 21:27:41,105 INFO L226 Difference]: Without dead ends: 502 [2019-12-18 21:27:41,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 21:27:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-18 21:27:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 422. [2019-12-18 21:27:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-18 21:27:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 779 transitions. [2019-12-18 21:27:41,112 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 779 transitions. Word has length 59 [2019-12-18 21:27:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:41,112 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 779 transitions. [2019-12-18 21:27:41,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:27:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 779 transitions. [2019-12-18 21:27:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:27:41,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:41,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:41,113 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:41,113 INFO L82 PathProgramCache]: Analyzing trace with hash 851087049, now seen corresponding path program 1 times [2019-12-18 21:27:41,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:41,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092210158] [2019-12-18 21:27:41,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:41,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092210158] [2019-12-18 21:27:41,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:41,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:27:41,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030901409] [2019-12-18 21:27:41,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:27:41,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:27:41,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:41,180 INFO L87 Difference]: Start difference. First operand 422 states and 779 transitions. Second operand 3 states. [2019-12-18 21:27:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:41,191 INFO L93 Difference]: Finished difference Result 365 states and 653 transitions. [2019-12-18 21:27:41,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:27:41,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:27:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:41,192 INFO L225 Difference]: With dead ends: 365 [2019-12-18 21:27:41,192 INFO L226 Difference]: Without dead ends: 365 [2019-12-18 21:27:41,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:41,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-12-18 21:27:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2019-12-18 21:27:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-12-18 21:27:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 653 transitions. [2019-12-18 21:27:41,198 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 653 transitions. Word has length 59 [2019-12-18 21:27:41,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:41,198 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 653 transitions. [2019-12-18 21:27:41,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:27:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 653 transitions. [2019-12-18 21:27:41,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:27:41,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:41,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:41,199 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:41,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:41,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1904792566, now seen corresponding path program 4 times [2019-12-18 21:27:41,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:41,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091310649] [2019-12-18 21:27:41,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:41,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091310649] [2019-12-18 21:27:41,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:41,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:27:41,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656460748] [2019-12-18 21:27:41,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:27:41,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:41,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:27:41,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:41,263 INFO L87 Difference]: Start difference. First operand 365 states and 653 transitions. Second operand 3 states. [2019-12-18 21:27:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:41,304 INFO L93 Difference]: Finished difference Result 364 states and 651 transitions. [2019-12-18 21:27:41,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:27:41,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:27:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:41,305 INFO L225 Difference]: With dead ends: 364 [2019-12-18 21:27:41,306 INFO L226 Difference]: Without dead ends: 364 [2019-12-18 21:27:41,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-12-18 21:27:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 236. [2019-12-18 21:27:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-18 21:27:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 419 transitions. [2019-12-18 21:27:41,310 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 419 transitions. Word has length 59 [2019-12-18 21:27:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:41,310 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 419 transitions. [2019-12-18 21:27:41,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:27:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 419 transitions. [2019-12-18 21:27:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:41,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:41,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:41,311 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 1 times [2019-12-18 21:27:41,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:41,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524092433] [2019-12-18 21:27:41,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:41,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524092433] [2019-12-18 21:27:41,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:41,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:27:41,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613112484] [2019-12-18 21:27:41,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:27:41,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:41,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:27:41,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:27:41,665 INFO L87 Difference]: Start difference. First operand 236 states and 419 transitions. Second operand 15 states. [2019-12-18 21:27:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:42,362 INFO L93 Difference]: Finished difference Result 409 states and 709 transitions. [2019-12-18 21:27:42,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:27:42,362 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-18 21:27:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:42,363 INFO L225 Difference]: With dead ends: 409 [2019-12-18 21:27:42,363 INFO L226 Difference]: Without dead ends: 378 [2019-12-18 21:27:42,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:27:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-12-18 21:27:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 336. [2019-12-18 21:27:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-18 21:27:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 590 transitions. [2019-12-18 21:27:42,369 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 590 transitions. Word has length 60 [2019-12-18 21:27:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:42,370 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 590 transitions. [2019-12-18 21:27:42,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:27:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 590 transitions. [2019-12-18 21:27:42,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:42,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:42,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:42,371 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:42,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:42,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1131398243, now seen corresponding path program 2 times [2019-12-18 21:27:42,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:42,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015017581] [2019-12-18 21:27:42,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:43,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015017581] [2019-12-18 21:27:43,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:43,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 21:27:43,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293363936] [2019-12-18 21:27:43,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 21:27:43,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:43,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 21:27:43,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:27:43,060 INFO L87 Difference]: Start difference. First operand 336 states and 590 transitions. Second operand 20 states. [2019-12-18 21:27:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:44,514 INFO L93 Difference]: Finished difference Result 771 states and 1329 transitions. [2019-12-18 21:27:44,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 21:27:44,515 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2019-12-18 21:27:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:44,516 INFO L225 Difference]: With dead ends: 771 [2019-12-18 21:27:44,516 INFO L226 Difference]: Without dead ends: 740 [2019-12-18 21:27:44,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=1364, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 21:27:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-12-18 21:27:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 352. [2019-12-18 21:27:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-18 21:27:44,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 621 transitions. [2019-12-18 21:27:44,523 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 621 transitions. Word has length 60 [2019-12-18 21:27:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:44,524 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 621 transitions. [2019-12-18 21:27:44,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 21:27:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 621 transitions. [2019-12-18 21:27:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:44,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:44,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:44,525 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:44,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:44,525 INFO L82 PathProgramCache]: Analyzing trace with hash -66309019, now seen corresponding path program 3 times [2019-12-18 21:27:44,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:44,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284418240] [2019-12-18 21:27:44,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:44,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284418240] [2019-12-18 21:27:44,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:44,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 21:27:44,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943086919] [2019-12-18 21:27:44,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 21:27:44,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:44,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 21:27:44,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:27:44,867 INFO L87 Difference]: Start difference. First operand 352 states and 621 transitions. Second operand 16 states. [2019-12-18 21:27:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:45,829 INFO L93 Difference]: Finished difference Result 546 states and 934 transitions. [2019-12-18 21:27:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 21:27:45,830 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2019-12-18 21:27:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:45,831 INFO L225 Difference]: With dead ends: 546 [2019-12-18 21:27:45,831 INFO L226 Difference]: Without dead ends: 515 [2019-12-18 21:27:45,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2019-12-18 21:27:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-12-18 21:27:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 346. [2019-12-18 21:27:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-18 21:27:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 608 transitions. [2019-12-18 21:27:45,836 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 608 transitions. Word has length 60 [2019-12-18 21:27:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:45,836 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 608 transitions. [2019-12-18 21:27:45,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 21:27:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 608 transitions. [2019-12-18 21:27:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:45,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:45,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:45,838 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:45,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:45,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1330572061, now seen corresponding path program 4 times [2019-12-18 21:27:45,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:45,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744817636] [2019-12-18 21:27:45,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:46,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744817636] [2019-12-18 21:27:46,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:46,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:27:46,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986483239] [2019-12-18 21:27:46,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:27:46,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:46,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:27:46,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:27:46,049 INFO L87 Difference]: Start difference. First operand 346 states and 608 transitions. Second operand 12 states. [2019-12-18 21:27:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:46,426 INFO L93 Difference]: Finished difference Result 447 states and 763 transitions. [2019-12-18 21:27:46,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:27:46,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 21:27:46,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:46,428 INFO L225 Difference]: With dead ends: 447 [2019-12-18 21:27:46,428 INFO L226 Difference]: Without dead ends: 416 [2019-12-18 21:27:46,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:27:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-12-18 21:27:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 344. [2019-12-18 21:27:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 21:27:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 604 transitions. [2019-12-18 21:27:46,433 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 604 transitions. Word has length 60 [2019-12-18 21:27:46,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:46,433 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 604 transitions. [2019-12-18 21:27:46,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:27:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 604 transitions. [2019-12-18 21:27:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:46,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:46,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:46,435 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:46,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:46,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 5 times [2019-12-18 21:27:46,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:46,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431897586] [2019-12-18 21:27:46,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:27:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:27:46,554 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:27:46,555 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:27:46,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= 0 v_~a~0_9) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff1_thd4~0_16) (= 0 |v_ULTIMATE.start_main_~#t1165~0.offset_16|) (= v_~z$r_buff1_thd2~0_9 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1165~0.base_19| 4) |v_#length_29|) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~b~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1165~0.base_19|)) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= v_~z$r_buff0_thd4~0_24 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1165~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1165~0.base_19|) |v_ULTIMATE.start_main_~#t1165~0.offset_16| 0)) |v_#memory_int_25|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1165~0.base_19|) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_25) (= v_~x~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1165~0.base_19| 1)) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~__unbuffered_p3_EBX~0_10) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start_main_~#t1167~0.base=|v_ULTIMATE.start_main_~#t1167~0.base_21|, ULTIMATE.start_main_~#t1167~0.offset=|v_ULTIMATE.start_main_~#t1167~0.offset_16|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ULTIMATE.start_main_~#t1165~0.offset=|v_ULTIMATE.start_main_~#t1165~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_12, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ULTIMATE.start_main_~#t1168~0.base=|v_ULTIMATE.start_main_~#t1168~0.base_22|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_9, ULTIMATE.start_main_~#t1165~0.base=|v_ULTIMATE.start_main_~#t1165~0.base_19|, ULTIMATE.start_main_~#t1166~0.offset=|v_ULTIMATE.start_main_~#t1166~0.offset_17|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1166~0.base=|v_ULTIMATE.start_main_~#t1166~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8, ULTIMATE.start_main_~#t1168~0.offset=|v_ULTIMATE.start_main_~#t1168~0.offset_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1167~0.base, ULTIMATE.start_main_~#t1167~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1165~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1168~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ULTIMATE.start_main_~#t1165~0.base, ULTIMATE.start_main_~#t1166~0.offset, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1166~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~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_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1168~0.offset] because there is no mapped edge [2019-12-18 21:27:46,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1166~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1166~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1166~0.base_13| 1)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1166~0.base_13|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1166~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t1166~0.offset_11|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1166~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1166~0.base_13|) |v_ULTIMATE.start_main_~#t1166~0.offset_11| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1166~0.base=|v_ULTIMATE.start_main_~#t1166~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1166~0.offset=|v_ULTIMATE.start_main_~#t1166~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1166~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1166~0.offset] because there is no mapped edge [2019-12-18 21:27:46,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1167~0.base_12|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1167~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1167~0.base_12|)) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1167~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1167~0.base_12|) |v_ULTIMATE.start_main_~#t1167~0.offset_10| 2))) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1167~0.base_12| 4) |v_#length_21|) (= 0 |v_ULTIMATE.start_main_~#t1167~0.offset_10|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1167~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1167~0.base=|v_ULTIMATE.start_main_~#t1167~0.base_12|, ULTIMATE.start_main_~#t1167~0.offset=|v_ULTIMATE.start_main_~#t1167~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1167~0.base, ULTIMATE.start_main_~#t1167~0.offset] because there is no mapped edge [2019-12-18 21:27:46,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1168~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1168~0.base_12|) |v_ULTIMATE.start_main_~#t1168~0.offset_10| 3))) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1168~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1168~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1168~0.base_12| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1168~0.base_12|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1168~0.base_12| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1168~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1168~0.base=|v_ULTIMATE.start_main_~#t1168~0.base_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1168~0.offset=|v_ULTIMATE.start_main_~#t1168~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1168~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1168~0.offset] because there is no mapped edge [2019-12-18 21:27:46,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} 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-18 21:27:46,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~x~0_7) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:27:46,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_5) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:27:46,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1604521141 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1604521141 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out-1604521141| ~z$w_buff0_used~0_In-1604521141) (or .cse0 .cse1)) (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-1604521141| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1604521141, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1604521141} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1604521141, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1604521141, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1604521141|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:27:46,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1202781242 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1202781242 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out1202781242| ~z~0_In1202781242) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out1202781242| ~z$w_buff1~0_In1202781242) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1202781242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1202781242, ~z$w_buff1~0=~z$w_buff1~0_In1202781242, ~z~0=~z~0_In1202781242} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1202781242|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1202781242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1202781242, ~z$w_buff1~0=~z$w_buff1~0_In1202781242, ~z~0=~z~0_In1202781242} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:27:46,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1174404874 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1174404874 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1174404874 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In1174404874 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1174404874 |P3Thread1of1ForFork3_#t~ite12_Out1174404874|)) (and (= |P3Thread1of1ForFork3_#t~ite12_Out1174404874| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1174404874, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1174404874, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1174404874, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1174404874} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1174404874, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1174404874, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1174404874, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1174404874, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1174404874|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:27:46,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1979020342 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1979020342 256) 0))) (or (and (= 0 ~z$r_buff0_thd4~0_Out1979020342) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out1979020342 ~z$r_buff0_thd4~0_In1979020342) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1979020342, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1979020342} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1979020342, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1979020342, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1979020342|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:27:46,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In-349580505 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-349580505 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-349580505 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-349580505 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-349580505| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork3_#t~ite14_Out-349580505| ~z$r_buff1_thd4~0_In-349580505) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-349580505, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-349580505, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-349580505, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-349580505} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-349580505, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-349580505, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-349580505|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-349580505, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-349580505} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:27:46,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:27:46,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:27:46,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-279433200 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-279433200 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-279433200| ~z$w_buff0_used~0_In-279433200)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-279433200| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-279433200, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-279433200} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-279433200|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-279433200, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-279433200} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:27:46,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1168374456 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1168374456 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1168374456 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1168374456 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out1168374456| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite6_Out1168374456| ~z$w_buff1_used~0_In1168374456) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1168374456, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1168374456, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1168374456, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1168374456} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1168374456|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1168374456, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1168374456, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1168374456, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1168374456} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:27:46,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1215840524 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1215840524 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out1215840524|) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out1215840524| ~z$r_buff0_thd3~0_In1215840524) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1215840524, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1215840524} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1215840524, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1215840524, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1215840524|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:27:46,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In533902940 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In533902940 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In533902940 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In533902940 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out533902940|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In533902940 |P2Thread1of1ForFork2_#t~ite8_Out533902940|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In533902940, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In533902940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In533902940, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In533902940} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In533902940, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In533902940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In533902940, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In533902940, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out533902940|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:27:46,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:27:46,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 21:27:46,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1068328639 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1068328639 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1068328639 |ULTIMATE.start_main_#t~ite19_Out-1068328639|)) (and (or .cse1 .cse0) (= ~z~0_In-1068328639 |ULTIMATE.start_main_#t~ite19_Out-1068328639|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1068328639, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1068328639, ~z$w_buff1~0=~z$w_buff1~0_In-1068328639, ~z~0=~z~0_In-1068328639} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1068328639|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1068328639, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1068328639, ~z$w_buff1~0=~z$w_buff1~0_In-1068328639, ~z~0=~z~0_In-1068328639} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:27:46,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:27:46,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1454219367 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1454219367 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1454219367 |ULTIMATE.start_main_#t~ite21_Out-1454219367|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1454219367|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1454219367, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1454219367} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1454219367, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1454219367, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1454219367|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:27:46,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1092793603 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1092793603 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1092793603 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1092793603 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1092793603|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1092793603 |ULTIMATE.start_main_#t~ite22_Out-1092793603|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1092793603, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1092793603, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1092793603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1092793603} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1092793603, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1092793603, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1092793603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1092793603, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1092793603|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:27:46,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1963676207 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1963676207 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out1963676207|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1963676207 |ULTIMATE.start_main_#t~ite23_Out1963676207|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1963676207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1963676207} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1963676207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1963676207, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1963676207|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:27:46,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In280917857 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In280917857 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In280917857 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In280917857 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In280917857 |ULTIMATE.start_main_#t~ite24_Out280917857|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite24_Out280917857|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In280917857, ~z$w_buff0_used~0=~z$w_buff0_used~0_In280917857, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In280917857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In280917857} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In280917857, ~z$w_buff0_used~0=~z$w_buff0_used~0_In280917857, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In280917857, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out280917857|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In280917857} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:27:46,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In821060843 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In821060843 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In821060843 256)) (and (= (mod ~z$r_buff1_thd0~0_In821060843 256) 0) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In821060843 256) 0)))) (= |ULTIMATE.start_main_#t~ite40_Out821060843| |ULTIMATE.start_main_#t~ite39_Out821060843|) (= ~z$w_buff1_used~0_In821060843 |ULTIMATE.start_main_#t~ite39_Out821060843|)) (and (= |ULTIMATE.start_main_#t~ite40_Out821060843| ~z$w_buff1_used~0_In821060843) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In821060843| |ULTIMATE.start_main_#t~ite39_Out821060843|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In821060843, ~z$w_buff0_used~0=~z$w_buff0_used~0_In821060843, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In821060843|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In821060843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821060843, ~weak$$choice2~0=~weak$$choice2~0_In821060843} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In821060843, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out821060843|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out821060843|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In821060843, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In821060843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821060843, ~weak$$choice2~0=~weak$$choice2~0_In821060843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:27:46,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:27:46,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In737178175 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In737178175 256) 0)) (.cse4 (= 0 (mod ~z$w_buff1_used~0_In737178175 256))) (.cse5 (= |ULTIMATE.start_main_#t~ite46_Out737178175| |ULTIMATE.start_main_#t~ite45_Out737178175|)) (.cse1 (= (mod ~z$w_buff0_used~0_In737178175 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In737178175 256) 0))) (or (and (or (and (= |ULTIMATE.start_main_#t~ite45_In737178175| |ULTIMATE.start_main_#t~ite45_Out737178175|) (= ~z$r_buff1_thd0~0_In737178175 |ULTIMATE.start_main_#t~ite46_Out737178175|) (not .cse0)) (and (or .cse1 (and .cse2 .cse3) (and .cse4 .cse2)) .cse0 .cse5 (= ~z$r_buff1_thd0~0_In737178175 |ULTIMATE.start_main_#t~ite45_Out737178175|))) (= |ULTIMATE.start_main_#t~ite44_In737178175| |ULTIMATE.start_main_#t~ite44_Out737178175|)) (let ((.cse6 (not .cse2))) (and .cse0 (or .cse6 (not .cse3)) (= 0 |ULTIMATE.start_main_#t~ite44_Out737178175|) (or (not .cse4) .cse6) (= |ULTIMATE.start_main_#t~ite45_Out737178175| |ULTIMATE.start_main_#t~ite44_Out737178175|) .cse5 (not .cse1))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In737178175, ~z$w_buff0_used~0=~z$w_buff0_used~0_In737178175, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In737178175, ~z$w_buff1_used~0=~z$w_buff1_used~0_In737178175, ~weak$$choice2~0=~weak$$choice2~0_In737178175, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In737178175|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In737178175|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In737178175, ~z$w_buff0_used~0=~z$w_buff0_used~0_In737178175, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In737178175, ~z$w_buff1_used~0=~z$w_buff1_used~0_In737178175, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out737178175|, ~weak$$choice2~0=~weak$$choice2~0_In737178175, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out737178175|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out737178175|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:27:46,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:27:46,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:27:46,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:27:46 BasicIcfg [2019-12-18 21:27:46,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:27:46,716 INFO L168 Benchmark]: Toolchain (without parser) took 32902.80 ms. Allocated memory was 145.8 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 100.3 MB in the beginning and 1.0 GB in the end (delta: -944.0 MB). Peak memory consumption was 410.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:27:46,717 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 21:27:46,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.32 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 156.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:27:46,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.84 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:27:46,722 INFO L168 Benchmark]: Boogie Preprocessor took 37.64 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 151.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:27:46,723 INFO L168 Benchmark]: RCFGBuilder took 887.67 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 101.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:27:46,724 INFO L168 Benchmark]: TraceAbstraction took 31078.60 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.3 MB in the beginning and 1.0 GB in the end (delta: -943.1 MB). Peak memory consumption was 353.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:27:46,732 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.19 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.32 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 156.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.84 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.64 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 151.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 887.67 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 101.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31078.60 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.3 MB in the beginning and 1.0 GB in the end (delta: -943.1 MB). Peak memory consumption was 353.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L835] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L837] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L839] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_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=0, weak$$choice2=0, x=2, y=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 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) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_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=0, weak$$choice2=0, x=2, y=1, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=0, weak$$choice2=0, x=2, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 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 [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.7s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2291 SDtfs, 2720 SDslu, 7591 SDs, 0 SdLazy, 4787 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 39 SyntacticMatches, 20 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 10146 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 986 NumberOfCodeBlocks, 986 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 906 ConstructedInterpolants, 0 QuantifiedInterpolants, 238604 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...