/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:07:33,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:07:33,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:07:33,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:07:33,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:07:33,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:07:33,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:07:33,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:07:33,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:07:33,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:07:33,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:07:33,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:07:33,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:07:33,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:07:33,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:07:33,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:07:33,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:07:33,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:07:33,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:07:33,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:07:33,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:07:33,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:07:33,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:07:33,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:07:33,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:07:33,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:07:33,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:07:33,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:07:33,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:07:33,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:07:33,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:07:33,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:07:33,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:07:33,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:07:33,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:07:33,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:07:33,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:07:33,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:07:33,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:07:33,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:07:33,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:07:33,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:07:33,662 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:07:33,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:07:33,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:07:33,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:07:33,667 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:07:33,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:07:33,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:07:33,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:07:33,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:07:33,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:07:33,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:07:33,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:07:33,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:07:33,671 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:07:33,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:07:33,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:07:33,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:07:33,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:07:33,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:07:33,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:07:33,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:07:33,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:07:33,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:07:33,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:07:33,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:07:33,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:07:33,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:07:33,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:07:33,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:07:33,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:07:34,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:07:34,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:07:34,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:07:34,012 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:07:34,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.opt.i [2019-12-18 19:07:34,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d2b1b27/feddd37143814943a8692c2fddfc495c/FLAG48fcc4f2f [2019-12-18 19:07:34,705 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:07:34,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.opt.i [2019-12-18 19:07:34,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d2b1b27/feddd37143814943a8692c2fddfc495c/FLAG48fcc4f2f [2019-12-18 19:07:34,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d2b1b27/feddd37143814943a8692c2fddfc495c [2019-12-18 19:07:34,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:07:34,928 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:07:34,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:07:34,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:07:34,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:07:34,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:07:34" (1/1) ... [2019-12-18 19:07:34,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a138a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:34, skipping insertion in model container [2019-12-18 19:07:34,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:07:34" (1/1) ... [2019-12-18 19:07:34,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:07:35,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:07:35,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:07:35,484 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:07:35,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:07:35,664 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:07:35,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35 WrapperNode [2019-12-18 19:07:35,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:07:35,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:07:35,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:07:35,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:07:35,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35" (1/1) ... [2019-12-18 19:07:35,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35" (1/1) ... [2019-12-18 19:07:35,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:07:35,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:07:35,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:07:35,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:07:35,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35" (1/1) ... [2019-12-18 19:07:35,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35" (1/1) ... [2019-12-18 19:07:35,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35" (1/1) ... [2019-12-18 19:07:35,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35" (1/1) ... [2019-12-18 19:07:35,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35" (1/1) ... [2019-12-18 19:07:35,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35" (1/1) ... [2019-12-18 19:07:35,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35" (1/1) ... [2019-12-18 19:07:35,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:07:35,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:07:35,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:07:35,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:07:35,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35" (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 19:07:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:07:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:07:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:07:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:07:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:07:35,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:07:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:07:35,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:07:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 19:07:35,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 19:07:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:07:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:07:35,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:07:35,854 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 19:07:36,548 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:07:36,548 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:07:36,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:07:36 BoogieIcfgContainer [2019-12-18 19:07:36,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:07:36,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:07:36,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:07:36,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:07:36,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:07:34" (1/3) ... [2019-12-18 19:07:36,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f0fc53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:07:36, skipping insertion in model container [2019-12-18 19:07:36,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:35" (2/3) ... [2019-12-18 19:07:36,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f0fc53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:07:36, skipping insertion in model container [2019-12-18 19:07:36,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:07:36" (3/3) ... [2019-12-18 19:07:36,559 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_power.opt.i [2019-12-18 19:07:36,569 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:07:36,570 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:07:36,577 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:07:36,578 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:07:36,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,645 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,645 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,658 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,658 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,662 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,666 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,671 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,672 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,673 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:36,719 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:07:36,736 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:07:36,737 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:07:36,737 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:07:36,737 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:07:36,737 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:07:36,737 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:07:36,737 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:07:36,737 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:07:36,755 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-18 19:07:36,757 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 19:07:36,844 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 19:07:36,844 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:07:36,859 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 19:07:36,878 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 19:07:36,917 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 19:07:36,917 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:07:36,923 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 19:07:36,937 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 19:07:36,938 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:07:41,553 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 19:07:41,692 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 19:07:41,875 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-12-18 19:07:41,875 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 19:07:41,879 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-12-18 19:07:42,728 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-12-18 19:07:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-12-18 19:07:42,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 19:07:42,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:42,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:42,738 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:42,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:42,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-12-18 19:07:42,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:42,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905571499] [2019-12-18 19:07:42,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:43,031 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 19:07:43,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905571499] [2019-12-18 19:07:43,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:43,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:07:43,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232564807] [2019-12-18 19:07:43,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:07:43,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:07:43,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:43,064 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-12-18 19:07:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:43,515 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-12-18 19:07:43,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:07:43,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 19:07:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:43,648 INFO L225 Difference]: With dead ends: 13722 [2019-12-18 19:07:43,649 INFO L226 Difference]: Without dead ends: 12214 [2019-12-18 19:07:43,650 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 19:07:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-12-18 19:07:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-12-18 19:07:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-12-18 19:07:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-12-18 19:07:44,949 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-12-18 19:07:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:44,950 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-12-18 19:07:44,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:07:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-12-18 19:07:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:07:44,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:44,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:44,970 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:44,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-12-18 19:07:44,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:44,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955646173] [2019-12-18 19:07:44,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:45,107 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 19:07:45,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955646173] [2019-12-18 19:07:45,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:45,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:07:45,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613858917] [2019-12-18 19:07:45,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:07:45,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:45,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:07:45,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:07:45,110 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-12-18 19:07:45,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:45,453 INFO L93 Difference]: Finished difference Result 18446 states and 67942 transitions. [2019-12-18 19:07:45,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:07:45,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 19:07:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:45,545 INFO L225 Difference]: With dead ends: 18446 [2019-12-18 19:07:45,545 INFO L226 Difference]: Without dead ends: 18390 [2019-12-18 19:07:45,546 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 19:07:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2019-12-18 19:07:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 16710. [2019-12-18 19:07:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-18 19:07:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 62402 transitions. [2019-12-18 19:07:46,307 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 62402 transitions. Word has length 13 [2019-12-18 19:07:46,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:46,307 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 62402 transitions. [2019-12-18 19:07:46,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:07:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 62402 transitions. [2019-12-18 19:07:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:07:46,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:46,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:46,313 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:46,314 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-12-18 19:07:46,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:46,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712964917] [2019-12-18 19:07:46,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:46,423 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 19:07:46,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712964917] [2019-12-18 19:07:46,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:46,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:07:46,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971818620] [2019-12-18 19:07:46,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:07:46,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:46,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:07:46,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:07:46,429 INFO L87 Difference]: Start difference. First operand 16710 states and 62402 transitions. Second operand 5 states. [2019-12-18 19:07:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:46,771 INFO L93 Difference]: Finished difference Result 24000 states and 87901 transitions. [2019-12-18 19:07:46,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:07:46,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 19:07:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:47,712 INFO L225 Difference]: With dead ends: 24000 [2019-12-18 19:07:47,713 INFO L226 Difference]: Without dead ends: 23924 [2019-12-18 19:07:47,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:07:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-12-18 19:07:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20292. [2019-12-18 19:07:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20292 states. [2019-12-18 19:07:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 75385 transitions. [2019-12-18 19:07:48,700 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 75385 transitions. Word has length 16 [2019-12-18 19:07:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:48,700 INFO L462 AbstractCegarLoop]: Abstraction has 20292 states and 75385 transitions. [2019-12-18 19:07:48,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:07:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 75385 transitions. [2019-12-18 19:07:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:07:48,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:48,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:48,711 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:48,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:48,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-12-18 19:07:48,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:48,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557118753] [2019-12-18 19:07:48,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:48,763 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 19:07:48,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557118753] [2019-12-18 19:07:48,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:48,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:07:48,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693460735] [2019-12-18 19:07:48,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:07:48,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:48,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:07:48,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:48,766 INFO L87 Difference]: Start difference. First operand 20292 states and 75385 transitions. Second operand 3 states. [2019-12-18 19:07:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:48,910 INFO L93 Difference]: Finished difference Result 20167 states and 74853 transitions. [2019-12-18 19:07:48,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:07:48,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 19:07:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:48,977 INFO L225 Difference]: With dead ends: 20167 [2019-12-18 19:07:48,978 INFO L226 Difference]: Without dead ends: 20167 [2019-12-18 19:07:48,978 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 19:07:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20167 states. [2019-12-18 19:07:49,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20167 to 20167. [2019-12-18 19:07:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20167 states. [2019-12-18 19:07:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20167 states to 20167 states and 74853 transitions. [2019-12-18 19:07:49,837 INFO L78 Accepts]: Start accepts. Automaton has 20167 states and 74853 transitions. Word has length 18 [2019-12-18 19:07:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:49,838 INFO L462 AbstractCegarLoop]: Abstraction has 20167 states and 74853 transitions. [2019-12-18 19:07:49,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:07:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20167 states and 74853 transitions. [2019-12-18 19:07:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:07:49,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:49,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:49,848 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash -292292173, now seen corresponding path program 1 times [2019-12-18 19:07:49,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:49,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135251619] [2019-12-18 19:07:49,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:49,994 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 19:07:49,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135251619] [2019-12-18 19:07:49,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:49,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:07:49,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779209482] [2019-12-18 19:07:49,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:07:49,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:49,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:07:49,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:49,997 INFO L87 Difference]: Start difference. First operand 20167 states and 74853 transitions. Second operand 3 states. [2019-12-18 19:07:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:50,100 INFO L93 Difference]: Finished difference Result 19155 states and 70209 transitions. [2019-12-18 19:07:50,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:07:50,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 19:07:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:50,155 INFO L225 Difference]: With dead ends: 19155 [2019-12-18 19:07:50,155 INFO L226 Difference]: Without dead ends: 19155 [2019-12-18 19:07:50,156 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 19:07:50,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19155 states. [2019-12-18 19:07:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19155 to 18891. [2019-12-18 19:07:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18891 states. [2019-12-18 19:07:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18891 states to 18891 states and 69309 transitions. [2019-12-18 19:07:51,874 INFO L78 Accepts]: Start accepts. Automaton has 18891 states and 69309 transitions. Word has length 19 [2019-12-18 19:07:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:51,875 INFO L462 AbstractCegarLoop]: Abstraction has 18891 states and 69309 transitions. [2019-12-18 19:07:51,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:07:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 18891 states and 69309 transitions. [2019-12-18 19:07:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:07:51,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:51,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:51,884 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:51,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:51,885 INFO L82 PathProgramCache]: Analyzing trace with hash 44045431, now seen corresponding path program 1 times [2019-12-18 19:07:51,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:51,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79022543] [2019-12-18 19:07:51,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:51,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79022543] [2019-12-18 19:07:51,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:51,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:07:51,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024143529] [2019-12-18 19:07:51,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:07:51,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:51,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:07:51,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:07:51,953 INFO L87 Difference]: Start difference. First operand 18891 states and 69309 transitions. Second operand 5 states. [2019-12-18 19:07:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:52,025 INFO L93 Difference]: Finished difference Result 3080 states and 9315 transitions. [2019-12-18 19:07:52,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:07:52,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 19:07:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:52,030 INFO L225 Difference]: With dead ends: 3080 [2019-12-18 19:07:52,031 INFO L226 Difference]: Without dead ends: 2014 [2019-12-18 19:07:52,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:07:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2019-12-18 19:07:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2014. [2019-12-18 19:07:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-18 19:07:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 5324 transitions. [2019-12-18 19:07:52,062 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 5324 transitions. Word has length 19 [2019-12-18 19:07:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:52,062 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 5324 transitions. [2019-12-18 19:07:52,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:07:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 5324 transitions. [2019-12-18 19:07:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 19:07:52,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:52,065 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 19:07:52,065 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:52,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-12-18 19:07:52,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:52,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502114661] [2019-12-18 19:07:52,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:52,115 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 19:07:52,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502114661] [2019-12-18 19:07:52,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:52,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:07:52,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819377996] [2019-12-18 19:07:52,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:07:52,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:52,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:07:52,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:52,118 INFO L87 Difference]: Start difference. First operand 2014 states and 5324 transitions. Second operand 3 states. [2019-12-18 19:07:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:52,168 INFO L93 Difference]: Finished difference Result 2850 states and 7274 transitions. [2019-12-18 19:07:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:07:52,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 19:07:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:52,172 INFO L225 Difference]: With dead ends: 2850 [2019-12-18 19:07:52,172 INFO L226 Difference]: Without dead ends: 2850 [2019-12-18 19:07:52,172 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 19:07:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2019-12-18 19:07:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2110. [2019-12-18 19:07:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-12-18 19:07:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 5466 transitions. [2019-12-18 19:07:52,209 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 5466 transitions. Word has length 29 [2019-12-18 19:07:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:52,209 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 5466 transitions. [2019-12-18 19:07:52,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:07:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 5466 transitions. [2019-12-18 19:07:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 19:07:52,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:52,213 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 19:07:52,214 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:52,214 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-12-18 19:07:52,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:52,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803785020] [2019-12-18 19:07:52,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:52,290 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 19:07:52,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803785020] [2019-12-18 19:07:52,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:52,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:07:52,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541449922] [2019-12-18 19:07:52,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:07:52,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:52,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:07:52,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:07:52,293 INFO L87 Difference]: Start difference. First operand 2110 states and 5466 transitions. Second operand 6 states. [2019-12-18 19:07:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:52,623 INFO L93 Difference]: Finished difference Result 3354 states and 8440 transitions. [2019-12-18 19:07:52,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 19:07:52,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 19:07:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:52,627 INFO L225 Difference]: With dead ends: 3354 [2019-12-18 19:07:52,627 INFO L226 Difference]: Without dead ends: 3346 [2019-12-18 19:07:52,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:07:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-12-18 19:07:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2160. [2019-12-18 19:07:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2019-12-18 19:07:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 5592 transitions. [2019-12-18 19:07:52,661 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 5592 transitions. Word has length 29 [2019-12-18 19:07:52,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:52,661 INFO L462 AbstractCegarLoop]: Abstraction has 2160 states and 5592 transitions. [2019-12-18 19:07:52,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:07:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 5592 transitions. [2019-12-18 19:07:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:07:52,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:52,665 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] [2019-12-18 19:07:52,665 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:52,666 INFO L82 PathProgramCache]: Analyzing trace with hash 804701306, now seen corresponding path program 1 times [2019-12-18 19:07:52,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:52,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54073873] [2019-12-18 19:07:52,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:52,713 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 19:07:52,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54073873] [2019-12-18 19:07:52,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:52,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:07:52,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697334644] [2019-12-18 19:07:52,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:07:52,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:52,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:07:52,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:52,715 INFO L87 Difference]: Start difference. First operand 2160 states and 5592 transitions. Second operand 3 states. [2019-12-18 19:07:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:52,732 INFO L93 Difference]: Finished difference Result 3414 states and 8503 transitions. [2019-12-18 19:07:52,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:07:52,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 19:07:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:52,736 INFO L225 Difference]: With dead ends: 3414 [2019-12-18 19:07:52,737 INFO L226 Difference]: Without dead ends: 2182 [2019-12-18 19:07:52,737 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 19:07:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-12-18 19:07:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2154. [2019-12-18 19:07:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-12-18 19:07:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 5480 transitions. [2019-12-18 19:07:52,770 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 5480 transitions. Word has length 30 [2019-12-18 19:07:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:52,770 INFO L462 AbstractCegarLoop]: Abstraction has 2154 states and 5480 transitions. [2019-12-18 19:07:52,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:07:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 5480 transitions. [2019-12-18 19:07:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:07:52,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:52,774 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] [2019-12-18 19:07:52,774 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:52,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:52,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1852558596, now seen corresponding path program 2 times [2019-12-18 19:07:52,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:52,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551345347] [2019-12-18 19:07:52,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:52,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551345347] [2019-12-18 19:07:52,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:52,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:07:52,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996516617] [2019-12-18 19:07:52,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:07:52,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:52,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:07:52,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:07:52,874 INFO L87 Difference]: Start difference. First operand 2154 states and 5480 transitions. Second operand 6 states. [2019-12-18 19:07:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:52,949 INFO L93 Difference]: Finished difference Result 1348 states and 3559 transitions. [2019-12-18 19:07:52,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:07:52,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-18 19:07:52,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:52,952 INFO L225 Difference]: With dead ends: 1348 [2019-12-18 19:07:52,952 INFO L226 Difference]: Without dead ends: 1142 [2019-12-18 19:07:52,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:07:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-12-18 19:07:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2019-12-18 19:07:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-12-18 19:07:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 3029 transitions. [2019-12-18 19:07:52,965 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 3029 transitions. Word has length 30 [2019-12-18 19:07:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:52,966 INFO L462 AbstractCegarLoop]: Abstraction has 1142 states and 3029 transitions. [2019-12-18 19:07:52,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:07:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 3029 transitions. [2019-12-18 19:07:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 19:07:52,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:52,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:52,969 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash 909005426, now seen corresponding path program 1 times [2019-12-18 19:07:52,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:52,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639111790] [2019-12-18 19:07:52,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:53,010 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 19:07:53,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639111790] [2019-12-18 19:07:53,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:53,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:07:53,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4004187] [2019-12-18 19:07:53,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:07:53,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:07:53,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:53,012 INFO L87 Difference]: Start difference. First operand 1142 states and 3029 transitions. Second operand 3 states. [2019-12-18 19:07:53,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:53,047 INFO L93 Difference]: Finished difference Result 1340 states and 3414 transitions. [2019-12-18 19:07:53,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:07:53,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-18 19:07:53,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:53,050 INFO L225 Difference]: With dead ends: 1340 [2019-12-18 19:07:53,050 INFO L226 Difference]: Without dead ends: 1340 [2019-12-18 19:07:53,050 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 19:07:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-12-18 19:07:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1192. [2019-12-18 19:07:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-12-18 19:07:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 3078 transitions. [2019-12-18 19:07:53,069 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 3078 transitions. Word has length 45 [2019-12-18 19:07:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:53,070 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 3078 transitions. [2019-12-18 19:07:53,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:07:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 3078 transitions. [2019-12-18 19:07:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 19:07:53,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:53,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:53,073 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash -928078620, now seen corresponding path program 1 times [2019-12-18 19:07:53,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:53,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715893980] [2019-12-18 19:07:53,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:53,149 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 19:07:53,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715893980] [2019-12-18 19:07:53,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:53,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:07:53,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800036341] [2019-12-18 19:07:53,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:07:53,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:53,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:07:53,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:07:53,151 INFO L87 Difference]: Start difference. First operand 1192 states and 3078 transitions. Second operand 7 states. [2019-12-18 19:07:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:53,441 INFO L93 Difference]: Finished difference Result 3208 states and 8220 transitions. [2019-12-18 19:07:53,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:07:53,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-18 19:07:53,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:53,446 INFO L225 Difference]: With dead ends: 3208 [2019-12-18 19:07:53,446 INFO L226 Difference]: Without dead ends: 2140 [2019-12-18 19:07:53,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:07:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-12-18 19:07:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1336. [2019-12-18 19:07:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-18 19:07:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3428 transitions. [2019-12-18 19:07:53,463 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3428 transitions. Word has length 45 [2019-12-18 19:07:53,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:53,463 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 3428 transitions. [2019-12-18 19:07:53,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:07:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3428 transitions. [2019-12-18 19:07:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 19:07:53,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:53,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:53,466 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:53,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:53,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 2 times [2019-12-18 19:07:53,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:53,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279428341] [2019-12-18 19:07:53,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:07:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:07:53,586 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:07:53,586 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:07:53,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t2580~0.base_31| 1)) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2580~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2580~0.base_31|) |v_ULTIMATE.start_main_~#t2580~0.offset_22| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2580~0.base_31|)) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= |v_ULTIMATE.start_main_~#t2580~0.offset_22| 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2580~0.base_31| 4)) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2580~0.base_31|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t2582~0.offset=|v_ULTIMATE.start_main_~#t2582~0.offset_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_~#t2580~0.base=|v_ULTIMATE.start_main_~#t2580~0.base_31|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t2581~0.offset=|v_ULTIMATE.start_main_~#t2581~0.offset_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2581~0.base=|v_ULTIMATE.start_main_~#t2581~0.base_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t2580~0.offset=|v_ULTIMATE.start_main_~#t2580~0.offset_22|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_~#t2582~0.base=|v_ULTIMATE.start_main_~#t2582~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2582~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ULTIMATE.start_main_~#t2581~0.offset, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2580~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2581~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2580~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2582~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:07:53,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2581~0.base_10|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2581~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2581~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2581~0.base_10|) |v_ULTIMATE.start_main_~#t2581~0.offset_9| 1)) |v_#memory_int_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2581~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t2581~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2581~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2581~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2581~0.offset=|v_ULTIMATE.start_main_~#t2581~0.offset_9|, ULTIMATE.start_main_~#t2581~0.base=|v_ULTIMATE.start_main_~#t2581~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2581~0.offset, ULTIMATE.start_main_~#t2581~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 19:07:53,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2582~0.base_11| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2582~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2582~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2582~0.base_11| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2582~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t2582~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2582~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2582~0.base_11|) |v_ULTIMATE.start_main_~#t2582~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2582~0.offset=|v_ULTIMATE.start_main_~#t2582~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2582~0.base=|v_ULTIMATE.start_main_~#t2582~0.base_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2582~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2582~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 19:07:53,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= 0 (mod v_~y$w_buff1_used~0_71 256)) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_16) (= v_P2Thread1of1ForFork2_~arg.offset_16 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16| 1) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_16, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_16, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:07:53,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_10 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_10 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_10, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_10} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 19:07:53,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1391175749 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out1391175749| ~y$w_buff0~0_In1391175749) (= |P1Thread1of1ForFork1_#t~ite8_In1391175749| |P1Thread1of1ForFork1_#t~ite8_Out1391175749|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1391175749 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1391175749 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In1391175749 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1391175749 256)))) (= ~y$w_buff0~0_In1391175749 |P1Thread1of1ForFork1_#t~ite8_Out1391175749|) (= |P1Thread1of1ForFork1_#t~ite9_Out1391175749| |P1Thread1of1ForFork1_#t~ite8_Out1391175749|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1391175749, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1391175749, ~y$w_buff0~0=~y$w_buff0~0_In1391175749, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1391175749, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1391175749|, ~weak$$choice2~0=~weak$$choice2~0_In1391175749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1391175749} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1391175749, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1391175749, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1391175749|, ~y$w_buff0~0=~y$w_buff0~0_In1391175749, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1391175749, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1391175749|, ~weak$$choice2~0=~weak$$choice2~0_In1391175749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1391175749} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 19:07:53,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In100357974 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out100357974| |P1Thread1of1ForFork1_#t~ite14_Out100357974|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In100357974 256)))) (or (= (mod ~y$w_buff0_used~0_In100357974 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In100357974 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In100357974 256) 0)))) (= ~y$w_buff0_used~0_In100357974 |P1Thread1of1ForFork1_#t~ite14_Out100357974|)) (and (= |P1Thread1of1ForFork1_#t~ite14_In100357974| |P1Thread1of1ForFork1_#t~ite14_Out100357974|) (= |P1Thread1of1ForFork1_#t~ite15_Out100357974| ~y$w_buff0_used~0_In100357974) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In100357974, ~y$w_buff0_used~0=~y$w_buff0_used~0_In100357974, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In100357974, ~weak$$choice2~0=~weak$$choice2~0_In100357974, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In100357974|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In100357974} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In100357974, ~y$w_buff0_used~0=~y$w_buff0_used~0_In100357974, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In100357974, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out100357974|, ~weak$$choice2~0=~weak$$choice2~0_In100357974, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out100357974|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In100357974} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 19:07:53,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_16|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 19:07:53,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-23434848 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-23434848 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-23434848| ~y$w_buff0_used~0_In-23434848)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-23434848|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-23434848, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-23434848} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-23434848, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-23434848, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-23434848|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 19:07:53,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 19:07:53,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1295065463 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1295065463 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1295065463 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In1295065463 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite29_Out1295065463| ~y$w_buff1_used~0_In1295065463) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite29_Out1295065463| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1295065463, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1295065463, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1295065463, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1295065463} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1295065463, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1295065463, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1295065463, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1295065463|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1295065463} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 19:07:53,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In76057848 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In76057848 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out76057848) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In76057848 ~y$r_buff0_thd3~0_Out76057848)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In76057848, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In76057848} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In76057848, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out76057848|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out76057848} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 19:07:53,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In8425384 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In8425384 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In8425384 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In8425384 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out8425384| ~y$r_buff1_thd3~0_In8425384) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite31_Out8425384| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In8425384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In8425384, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In8425384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In8425384} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In8425384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In8425384, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out8425384|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In8425384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In8425384} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 19:07:53,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_38| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_37|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 19:07:53,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 19:07:53,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-614144207 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-614144207 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-614144207 |ULTIMATE.start_main_#t~ite35_Out-614144207|)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-614144207 |ULTIMATE.start_main_#t~ite35_Out-614144207|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-614144207, ~y~0=~y~0_In-614144207, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-614144207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-614144207} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-614144207, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-614144207|, ~y~0=~y~0_In-614144207, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-614144207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-614144207} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 19:07:53,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-18 19:07:53,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-723151944 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-723151944 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-723151944| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-723151944 |ULTIMATE.start_main_#t~ite37_Out-723151944|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-723151944, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-723151944} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-723151944, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-723151944, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-723151944|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 19:07:53,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1824141665 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1824141665 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1824141665 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1824141665 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1824141665| ~y$w_buff1_used~0_In-1824141665) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1824141665| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1824141665, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1824141665, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1824141665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1824141665} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1824141665, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1824141665, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1824141665|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1824141665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1824141665} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 19:07:53,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-789178709 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-789178709 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-789178709|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-789178709 |ULTIMATE.start_main_#t~ite39_Out-789178709|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-789178709, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-789178709} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-789178709, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-789178709|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-789178709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 19:07:53,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1310616105 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1310616105 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1310616105 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1310616105 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-1310616105|)) (and (= ~y$r_buff1_thd0~0_In-1310616105 |ULTIMATE.start_main_#t~ite40_Out-1310616105|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1310616105, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1310616105, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1310616105, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1310616105} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1310616105|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1310616105, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1310616105, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1310616105, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1310616105} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 19:07:53,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:07:53,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:07:53 BasicIcfg [2019-12-18 19:07:53,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:07:53,729 INFO L168 Benchmark]: Toolchain (without parser) took 18800.40 ms. Allocated memory was 137.9 MB in the beginning and 1.1 GB in the end (delta: 914.9 MB). Free memory was 100.9 MB in the beginning and 744.6 MB in the end (delta: -643.7 MB). Peak memory consumption was 271.2 MB. Max. memory is 7.1 GB. [2019-12-18 19:07:53,730 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 19:07:53,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.41 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 155.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:07:53,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.44 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 153.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 19:07:53,735 INFO L168 Benchmark]: Boogie Preprocessor took 42.15 ms. Allocated memory is still 201.3 MB. Free memory was 153.2 MB in the beginning and 150.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:07:53,736 INFO L168 Benchmark]: RCFGBuilder took 773.51 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 107.5 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:07:53,736 INFO L168 Benchmark]: TraceAbstraction took 17174.41 ms. Allocated memory was 201.3 MB in the beginning and 1.1 GB in the end (delta: 851.4 MB). Free memory was 107.5 MB in the beginning and 744.6 MB in the end (delta: -637.1 MB). Peak memory consumption was 214.4 MB. Max. memory is 7.1 GB. [2019-12-18 19:07:53,746 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 736.41 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 155.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.44 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.15 ms. Allocated memory is still 201.3 MB. Free memory was 153.2 MB in the beginning and 150.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 773.51 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 107.5 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17174.41 ms. Allocated memory was 201.3 MB in the beginning and 1.1 GB in the end (delta: 851.4 MB). Free memory was 107.5 MB in the beginning and 744.6 MB in the end (delta: -637.1 MB). Peak memory consumption was 214.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2580, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2581, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2582, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1327 SDtfs, 1496 SDslu, 2293 SDs, 0 SdLazy, 777 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20292occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 8482 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 23716 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...