/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:55:13,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:55:13,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:55:13,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:55:13,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:55:13,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:55:13,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:55:13,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:55:13,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:55:13,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:55:13,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:55:13,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:55:13,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:55:13,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:55:13,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:55:13,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:55:13,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:55:13,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:55:13,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:55:13,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:55:13,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:55:13,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:55:13,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:55:13,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:55:13,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:55:13,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:55:13,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:55:13,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:55:13,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:55:13,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:55:13,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:55:13,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:55:13,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:55:13,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:55:13,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:55:13,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:55:13,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:55:13,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:55:13,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:55:13,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:55:13,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:55:13,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-VariableLbe.epf [2019-12-18 19:55:13,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:55:13,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:55:13,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:55:13,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:55:13,652 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:55:13,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:55:13,652 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:55:13,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:55:13,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:55:13,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:55:13,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:55:13,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:55:13,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:55:13,654 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:55:13,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:55:13,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:55:13,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:55:13,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:55:13,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:55:13,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:55:13,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:55:13,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:55:13,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:55:13,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:55:13,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:55:13,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:55:13,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:55:13,657 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 19:55:13,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:55:13,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:55:13,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:55:13,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:55:13,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:55:13,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:55:13,974 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:55:13,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_pso.opt.i [2019-12-18 19:55:14,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adffc199a/310a1032061646f4b539dda07c7e251d/FLAG2a2740d0f [2019-12-18 19:55:14,609 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:55:14,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_pso.opt.i [2019-12-18 19:55:14,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adffc199a/310a1032061646f4b539dda07c7e251d/FLAG2a2740d0f [2019-12-18 19:55:14,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adffc199a/310a1032061646f4b539dda07c7e251d [2019-12-18 19:55:14,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:55:14,895 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:55:14,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:55:14,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:55:14,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:55:14,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:55:14" (1/1) ... [2019-12-18 19:55:14,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d61e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:55:14, skipping insertion in model container [2019-12-18 19:55:14,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:55:14" (1/1) ... [2019-12-18 19:55:14,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:55:14,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:55:15,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:55:15,586 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:55:15,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:55:15,736 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:55:15,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:55:15 WrapperNode [2019-12-18 19:55:15,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:55:15,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:55:15,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:55:15,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:55:15,747 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:55:15" (1/1) ... [2019-12-18 19:55:15,780 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:55:15" (1/1) ... [2019-12-18 19:55:15,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:55:15,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:55:15,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:55:15,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:55:15,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:55:15" (1/1) ... [2019-12-18 19:55:15,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:55:15" (1/1) ... [2019-12-18 19:55:15,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:55:15" (1/1) ... [2019-12-18 19:55:15,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:55:15" (1/1) ... [2019-12-18 19:55:15,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:55:15" (1/1) ... [2019-12-18 19:55:15,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:55:15" (1/1) ... [2019-12-18 19:55:15,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:55:15" (1/1) ... [2019-12-18 19:55:15,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:55:15,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:55:15,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:55:15,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:55:15,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:55:15" (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:55:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:55:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:55:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:55:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:55:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:55:15,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:55:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:55:15,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:55:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 19:55:15,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 19:55:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:55:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:55:15,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:55:15,934 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:55:16,795 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:55:16,795 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:55:16,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:55:16 BoogieIcfgContainer [2019-12-18 19:55:16,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:55:16,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:55:16,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:55:16,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:55:16,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:55:14" (1/3) ... [2019-12-18 19:55:16,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e248ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:55:16, skipping insertion in model container [2019-12-18 19:55:16,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:55:15" (2/3) ... [2019-12-18 19:55:16,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e248ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:55:16, skipping insertion in model container [2019-12-18 19:55:16,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:55:16" (3/3) ... [2019-12-18 19:55:16,806 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_pso.opt.i [2019-12-18 19:55:16,817 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:55:16,817 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:55:16,825 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:55:16,827 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:55:16,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,890 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,915 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,915 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,915 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,915 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,915 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,943 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,944 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,953 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,953 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:55:16,983 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:55:17,005 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:55:17,006 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:55:17,006 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:55:17,006 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:55:17,006 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:55:17,006 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:55:17,006 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:55:17,007 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:55:17,031 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-18 19:55:17,034 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 19:55:17,147 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 19:55:17,148 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:55:17,169 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 19:55:17,210 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 19:55:17,318 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 19:55:17,318 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:55:17,331 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 19:55:17,362 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 19:55:17,363 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 19:55:21,395 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 19:55:21,543 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 19:55:21,591 INFO L206 etLargeBlockEncoding]: Checked pairs total: 134958 [2019-12-18 19:55:21,591 INFO L214 etLargeBlockEncoding]: Total number of compositions: 125 [2019-12-18 19:55:21,595 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 127 transitions [2019-12-18 19:55:25,276 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 43566 states. [2019-12-18 19:55:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 43566 states. [2019-12-18 19:55:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 19:55:25,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:25,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:25,286 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:55:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:25,292 INFO L82 PathProgramCache]: Analyzing trace with hash -616580539, now seen corresponding path program 1 times [2019-12-18 19:55:25,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:25,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045859303] [2019-12-18 19:55:25,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:25,565 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:55:25,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045859303] [2019-12-18 19:55:25,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:25,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:55:25,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81740829] [2019-12-18 19:55:25,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:55:25,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:25,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:55:25,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:55:25,597 INFO L87 Difference]: Start difference. First operand 43566 states. Second operand 3 states. [2019-12-18 19:55:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:26,623 INFO L93 Difference]: Finished difference Result 43014 states and 174370 transitions. [2019-12-18 19:55:26,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:55:26,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 19:55:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:26,997 INFO L225 Difference]: With dead ends: 43014 [2019-12-18 19:55:26,997 INFO L226 Difference]: Without dead ends: 40044 [2019-12-18 19:55:27,007 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:55:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40044 states. [2019-12-18 19:55:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40044 to 40044. [2019-12-18 19:55:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40044 states. [2019-12-18 19:55:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40044 states to 40044 states and 162217 transitions. [2019-12-18 19:55:30,500 INFO L78 Accepts]: Start accepts. Automaton has 40044 states and 162217 transitions. Word has length 7 [2019-12-18 19:55:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:30,502 INFO L462 AbstractCegarLoop]: Abstraction has 40044 states and 162217 transitions. [2019-12-18 19:55:30,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:55:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 40044 states and 162217 transitions. [2019-12-18 19:55:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:55:30,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:30,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:30,514 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:55:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1408183665, now seen corresponding path program 1 times [2019-12-18 19:55:30,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:30,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158067664] [2019-12-18 19:55:30,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:30,712 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:55:30,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158067664] [2019-12-18 19:55:30,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:30,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:55:30,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729561942] [2019-12-18 19:55:30,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:55:30,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:30,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:55:30,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:55:30,715 INFO L87 Difference]: Start difference. First operand 40044 states and 162217 transitions. Second operand 4 states. [2019-12-18 19:55:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:33,027 INFO L93 Difference]: Finished difference Result 63338 states and 247308 transitions. [2019-12-18 19:55:33,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:55:33,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 19:55:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:33,377 INFO L225 Difference]: With dead ends: 63338 [2019-12-18 19:55:33,377 INFO L226 Difference]: Without dead ends: 63310 [2019-12-18 19:55:33,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:55:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-18 19:55:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 60640. [2019-12-18 19:55:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60640 states. [2019-12-18 19:55:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60640 states to 60640 states and 238729 transitions. [2019-12-18 19:55:36,014 INFO L78 Accepts]: Start accepts. Automaton has 60640 states and 238729 transitions. Word has length 13 [2019-12-18 19:55:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:36,015 INFO L462 AbstractCegarLoop]: Abstraction has 60640 states and 238729 transitions. [2019-12-18 19:55:36,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:55:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 60640 states and 238729 transitions. [2019-12-18 19:55:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:55:36,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:36,021 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:55:36,021 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:55:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:36,022 INFO L82 PathProgramCache]: Analyzing trace with hash -903300069, now seen corresponding path program 1 times [2019-12-18 19:55:36,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:36,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126007242] [2019-12-18 19:55:36,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:36,108 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:55:36,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126007242] [2019-12-18 19:55:36,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:36,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:55:36,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679954071] [2019-12-18 19:55:36,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:55:36,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:36,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:55:36,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:55:36,110 INFO L87 Difference]: Start difference. First operand 60640 states and 238729 transitions. Second operand 4 states. [2019-12-18 19:55:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:38,476 INFO L93 Difference]: Finished difference Result 77848 states and 302341 transitions. [2019-12-18 19:55:38,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:55:38,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 19:55:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:38,758 INFO L225 Difference]: With dead ends: 77848 [2019-12-18 19:55:38,758 INFO L226 Difference]: Without dead ends: 77820 [2019-12-18 19:55:38,758 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:55:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77820 states. [2019-12-18 19:55:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77820 to 68750. [2019-12-18 19:55:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68750 states. [2019-12-18 19:55:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68750 states to 68750 states and 269586 transitions. [2019-12-18 19:55:41,478 INFO L78 Accepts]: Start accepts. Automaton has 68750 states and 269586 transitions. Word has length 16 [2019-12-18 19:55:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:41,478 INFO L462 AbstractCegarLoop]: Abstraction has 68750 states and 269586 transitions. [2019-12-18 19:55:41,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:55:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 68750 states and 269586 transitions. [2019-12-18 19:55:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:55:41,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:41,489 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:55:41,489 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:55:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1875943098, now seen corresponding path program 1 times [2019-12-18 19:55:41,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:41,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674777653] [2019-12-18 19:55:41,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:41,561 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:55:41,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674777653] [2019-12-18 19:55:41,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:41,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:55:41,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690641301] [2019-12-18 19:55:41,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:55:41,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:41,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:55:41,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:55:41,564 INFO L87 Difference]: Start difference. First operand 68750 states and 269586 transitions. Second operand 3 states. [2019-12-18 19:55:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:44,062 INFO L93 Difference]: Finished difference Result 65858 states and 256753 transitions. [2019-12-18 19:55:44,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:55:44,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 19:55:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:44,232 INFO L225 Difference]: With dead ends: 65858 [2019-12-18 19:55:44,232 INFO L226 Difference]: Without dead ends: 65858 [2019-12-18 19:55:44,232 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:55:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65858 states. [2019-12-18 19:55:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65858 to 65858. [2019-12-18 19:55:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65858 states. [2019-12-18 19:55:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65858 states to 65858 states and 256753 transitions. [2019-12-18 19:55:46,444 INFO L78 Accepts]: Start accepts. Automaton has 65858 states and 256753 transitions. Word has length 18 [2019-12-18 19:55:46,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:46,444 INFO L462 AbstractCegarLoop]: Abstraction has 65858 states and 256753 transitions. [2019-12-18 19:55:46,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:55:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 65858 states and 256753 transitions. [2019-12-18 19:55:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:55:46,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:46,457 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:55:46,457 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:55:46,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:46,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1842577503, now seen corresponding path program 1 times [2019-12-18 19:55:46,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:46,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798893275] [2019-12-18 19:55:46,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:46,531 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:55:46,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798893275] [2019-12-18 19:55:46,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:46,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:55:46,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634815810] [2019-12-18 19:55:46,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:55:46,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:46,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:55:46,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:55:46,533 INFO L87 Difference]: Start difference. First operand 65858 states and 256753 transitions. Second operand 3 states. [2019-12-18 19:55:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:46,849 INFO L93 Difference]: Finished difference Result 63720 states and 249248 transitions. [2019-12-18 19:55:46,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:55:46,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 19:55:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:47,002 INFO L225 Difference]: With dead ends: 63720 [2019-12-18 19:55:47,002 INFO L226 Difference]: Without dead ends: 63552 [2019-12-18 19:55:47,003 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:55:48,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63552 states. [2019-12-18 19:55:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63552 to 63552. [2019-12-18 19:55:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63552 states. [2019-12-18 19:55:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63552 states to 63552 states and 248652 transitions. [2019-12-18 19:55:52,577 INFO L78 Accepts]: Start accepts. Automaton has 63552 states and 248652 transitions. Word has length 19 [2019-12-18 19:55:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:52,577 INFO L462 AbstractCegarLoop]: Abstraction has 63552 states and 248652 transitions. [2019-12-18 19:55:52,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:55:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 63552 states and 248652 transitions. [2019-12-18 19:55:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:55:52,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:52,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:52,598 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:55:52,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:52,599 INFO L82 PathProgramCache]: Analyzing trace with hash -813341911, now seen corresponding path program 1 times [2019-12-18 19:55:52,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:52,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608425843] [2019-12-18 19:55:52,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:52,716 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:55:52,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608425843] [2019-12-18 19:55:52,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:52,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:55:52,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815438306] [2019-12-18 19:55:52,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:55:52,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:52,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:55:52,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:55:52,719 INFO L87 Difference]: Start difference. First operand 63552 states and 248652 transitions. Second operand 5 states. [2019-12-18 19:55:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:53,734 INFO L93 Difference]: Finished difference Result 75918 states and 293174 transitions. [2019-12-18 19:55:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:55:53,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 19:55:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:53,915 INFO L225 Difference]: With dead ends: 75918 [2019-12-18 19:55:53,916 INFO L226 Difference]: Without dead ends: 75866 [2019-12-18 19:55:53,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:55:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75866 states. [2019-12-18 19:55:58,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75866 to 63240. [2019-12-18 19:55:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63240 states. [2019-12-18 19:55:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63240 states to 63240 states and 247578 transitions. [2019-12-18 19:55:58,817 INFO L78 Accepts]: Start accepts. Automaton has 63240 states and 247578 transitions. Word has length 22 [2019-12-18 19:55:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:58,817 INFO L462 AbstractCegarLoop]: Abstraction has 63240 states and 247578 transitions. [2019-12-18 19:55:58,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:55:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 63240 states and 247578 transitions. [2019-12-18 19:55:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 19:55:58,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:58,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:58,887 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:55:58,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:58,888 INFO L82 PathProgramCache]: Analyzing trace with hash 905995009, now seen corresponding path program 1 times [2019-12-18 19:55:58,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:58,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249875870] [2019-12-18 19:55:58,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:58,945 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:55:58,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249875870] [2019-12-18 19:55:58,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:58,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:55:58,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277466835] [2019-12-18 19:55:58,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:55:58,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:58,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:55:58,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:55:58,948 INFO L87 Difference]: Start difference. First operand 63240 states and 247578 transitions. Second operand 5 states. [2019-12-18 19:55:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:59,468 INFO L93 Difference]: Finished difference Result 96384 states and 382320 transitions. [2019-12-18 19:55:59,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:55:59,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 19:55:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:59,669 INFO L225 Difference]: With dead ends: 96384 [2019-12-18 19:55:59,669 INFO L226 Difference]: Without dead ends: 84152 [2019-12-18 19:55:59,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:56:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84152 states. [2019-12-18 19:56:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84152 to 84152. [2019-12-18 19:56:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84152 states. [2019-12-18 19:56:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84152 states to 84152 states and 335460 transitions. [2019-12-18 19:56:05,455 INFO L78 Accepts]: Start accepts. Automaton has 84152 states and 335460 transitions. Word has length 33 [2019-12-18 19:56:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:05,456 INFO L462 AbstractCegarLoop]: Abstraction has 84152 states and 335460 transitions. [2019-12-18 19:56:05,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:56:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 84152 states and 335460 transitions. [2019-12-18 19:56:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 19:56:05,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:05,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:05,579 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:56:05,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:05,579 INFO L82 PathProgramCache]: Analyzing trace with hash 830115435, now seen corresponding path program 2 times [2019-12-18 19:56:05,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:05,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310132077] [2019-12-18 19:56:05,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:56:05,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310132077] [2019-12-18 19:56:05,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:05,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:56:05,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033266769] [2019-12-18 19:56:05,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:56:05,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:05,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:56:05,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:56:05,635 INFO L87 Difference]: Start difference. First operand 84152 states and 335460 transitions. Second operand 3 states. [2019-12-18 19:56:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:06,025 INFO L93 Difference]: Finished difference Result 84126 states and 335383 transitions. [2019-12-18 19:56:06,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:56:06,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 19:56:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:06,245 INFO L225 Difference]: With dead ends: 84126 [2019-12-18 19:56:06,246 INFO L226 Difference]: Without dead ends: 84126 [2019-12-18 19:56:06,246 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:56:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84126 states. [2019-12-18 19:56:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84126 to 84126. [2019-12-18 19:56:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84126 states. [2019-12-18 19:56:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84126 states to 84126 states and 335383 transitions. [2019-12-18 19:56:09,775 INFO L78 Accepts]: Start accepts. Automaton has 84126 states and 335383 transitions. Word has length 33 [2019-12-18 19:56:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:09,775 INFO L462 AbstractCegarLoop]: Abstraction has 84126 states and 335383 transitions. [2019-12-18 19:56:09,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:56:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 84126 states and 335383 transitions. [2019-12-18 19:56:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 19:56:09,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:09,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:09,913 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:56:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:09,913 INFO L82 PathProgramCache]: Analyzing trace with hash -893352396, now seen corresponding path program 1 times [2019-12-18 19:56:09,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:09,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745856457] [2019-12-18 19:56:09,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:09,978 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:56:09,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745856457] [2019-12-18 19:56:09,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:09,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:56:09,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006987665] [2019-12-18 19:56:09,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:56:09,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:09,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:56:09,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:56:09,981 INFO L87 Difference]: Start difference. First operand 84126 states and 335383 transitions. Second operand 4 states. [2019-12-18 19:56:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:10,881 INFO L93 Difference]: Finished difference Result 152143 states and 601736 transitions. [2019-12-18 19:56:10,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:56:10,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-18 19:56:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:11,289 INFO L225 Difference]: With dead ends: 152143 [2019-12-18 19:56:11,289 INFO L226 Difference]: Without dead ends: 152143 [2019-12-18 19:56:11,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:56:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152143 states. [2019-12-18 19:56:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152143 to 126591. [2019-12-18 19:56:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126591 states. [2019-12-18 19:56:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126591 states to 126591 states and 506137 transitions. [2019-12-18 19:56:19,049 INFO L78 Accepts]: Start accepts. Automaton has 126591 states and 506137 transitions. Word has length 34 [2019-12-18 19:56:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:19,049 INFO L462 AbstractCegarLoop]: Abstraction has 126591 states and 506137 transitions. [2019-12-18 19:56:19,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:56:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 126591 states and 506137 transitions. [2019-12-18 19:56:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 19:56:19,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:19,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:19,213 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:56:19,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:19,213 INFO L82 PathProgramCache]: Analyzing trace with hash -340688198, now seen corresponding path program 2 times [2019-12-18 19:56:19,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:19,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136627596] [2019-12-18 19:56:19,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:19,291 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:56:19,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136627596] [2019-12-18 19:56:19,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:19,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:56:19,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302470088] [2019-12-18 19:56:19,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:56:19,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:19,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:56:19,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:56:19,293 INFO L87 Difference]: Start difference. First operand 126591 states and 506137 transitions. Second operand 5 states. [2019-12-18 19:56:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:20,309 INFO L93 Difference]: Finished difference Result 20188 states and 68864 transitions. [2019-12-18 19:56:20,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:56:20,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 19:56:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:20,330 INFO L225 Difference]: With dead ends: 20188 [2019-12-18 19:56:20,330 INFO L226 Difference]: Without dead ends: 11066 [2019-12-18 19:56:20,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:56:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-12-18 19:56:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 10970. [2019-12-18 19:56:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10970 states. [2019-12-18 19:56:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10970 states to 10970 states and 32033 transitions. [2019-12-18 19:56:20,466 INFO L78 Accepts]: Start accepts. Automaton has 10970 states and 32033 transitions. Word has length 34 [2019-12-18 19:56:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:20,466 INFO L462 AbstractCegarLoop]: Abstraction has 10970 states and 32033 transitions. [2019-12-18 19:56:20,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:56:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 10970 states and 32033 transitions. [2019-12-18 19:56:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-18 19:56:20,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:20,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:20,478 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:56:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash -266810409, now seen corresponding path program 1 times [2019-12-18 19:56:20,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:20,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904600442] [2019-12-18 19:56:20,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:20,548 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:56:20,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904600442] [2019-12-18 19:56:20,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:20,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:56:20,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164499201] [2019-12-18 19:56:20,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:56:20,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:20,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:56:20,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:56:20,551 INFO L87 Difference]: Start difference. First operand 10970 states and 32033 transitions. Second operand 4 states. [2019-12-18 19:56:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:20,606 INFO L93 Difference]: Finished difference Result 12144 states and 34751 transitions. [2019-12-18 19:56:20,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:56:20,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-18 19:56:20,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:20,625 INFO L225 Difference]: With dead ends: 12144 [2019-12-18 19:56:20,625 INFO L226 Difference]: Without dead ends: 10974 [2019-12-18 19:56:20,626 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:56:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10974 states. [2019-12-18 19:56:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10974 to 10412. [2019-12-18 19:56:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10412 states. [2019-12-18 19:56:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10412 states to 10412 states and 30592 transitions. [2019-12-18 19:56:20,773 INFO L78 Accepts]: Start accepts. Automaton has 10412 states and 30592 transitions. Word has length 46 [2019-12-18 19:56:20,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:20,773 INFO L462 AbstractCegarLoop]: Abstraction has 10412 states and 30592 transitions. [2019-12-18 19:56:20,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:56:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 10412 states and 30592 transitions. [2019-12-18 19:56:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-18 19:56:20,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:20,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:20,784 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:56:20,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:20,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1234135045, now seen corresponding path program 2 times [2019-12-18 19:56:20,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:20,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940498805] [2019-12-18 19:56:20,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:20,840 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:56:20,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940498805] [2019-12-18 19:56:20,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:20,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:56:20,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628109756] [2019-12-18 19:56:20,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:56:20,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:56:20,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:56:20,842 INFO L87 Difference]: Start difference. First operand 10412 states and 30592 transitions. Second operand 4 states. [2019-12-18 19:56:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:20,910 INFO L93 Difference]: Finished difference Result 15821 states and 44105 transitions. [2019-12-18 19:56:20,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:56:20,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-18 19:56:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:20,919 INFO L225 Difference]: With dead ends: 15821 [2019-12-18 19:56:20,919 INFO L226 Difference]: Without dead ends: 5670 [2019-12-18 19:56:20,919 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:56:20,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5670 states. [2019-12-18 19:56:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5670 to 5664. [2019-12-18 19:56:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5664 states. [2019-12-18 19:56:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5664 states to 5664 states and 14081 transitions. [2019-12-18 19:56:21,018 INFO L78 Accepts]: Start accepts. Automaton has 5664 states and 14081 transitions. Word has length 46 [2019-12-18 19:56:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:21,018 INFO L462 AbstractCegarLoop]: Abstraction has 5664 states and 14081 transitions. [2019-12-18 19:56:21,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:56:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5664 states and 14081 transitions. [2019-12-18 19:56:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-18 19:56:21,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:21,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:21,028 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:56:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash -970485165, now seen corresponding path program 3 times [2019-12-18 19:56:21,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:21,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701352789] [2019-12-18 19:56:21,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:21,116 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:56:21,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701352789] [2019-12-18 19:56:21,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:21,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:56:21,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964810900] [2019-12-18 19:56:21,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:56:21,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:21,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:56:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:56:21,119 INFO L87 Difference]: Start difference. First operand 5664 states and 14081 transitions. Second operand 5 states. [2019-12-18 19:56:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:21,552 INFO L93 Difference]: Finished difference Result 6264 states and 15364 transitions. [2019-12-18 19:56:21,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:56:21,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-18 19:56:21,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:21,561 INFO L225 Difference]: With dead ends: 6264 [2019-12-18 19:56:21,562 INFO L226 Difference]: Without dead ends: 6264 [2019-12-18 19:56:21,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:56:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2019-12-18 19:56:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 6095. [2019-12-18 19:56:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6095 states. [2019-12-18 19:56:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6095 states to 6095 states and 15038 transitions. [2019-12-18 19:56:21,629 INFO L78 Accepts]: Start accepts. Automaton has 6095 states and 15038 transitions. Word has length 46 [2019-12-18 19:56:21,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:21,629 INFO L462 AbstractCegarLoop]: Abstraction has 6095 states and 15038 transitions. [2019-12-18 19:56:21,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:56:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6095 states and 15038 transitions. [2019-12-18 19:56:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 19:56:21,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:21,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:21,635 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:21,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:21,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1930278651, now seen corresponding path program 1 times [2019-12-18 19:56:21,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:21,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238994782] [2019-12-18 19:56:21,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:21,755 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:56:21,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238994782] [2019-12-18 19:56:21,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:21,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:56:21,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011211117] [2019-12-18 19:56:21,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:56:21,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:21,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:56:21,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:56:21,760 INFO L87 Difference]: Start difference. First operand 6095 states and 15038 transitions. Second operand 6 states. [2019-12-18 19:56:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:21,842 INFO L93 Difference]: Finished difference Result 4542 states and 11306 transitions. [2019-12-18 19:56:21,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:56:21,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 19:56:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:21,844 INFO L225 Difference]: With dead ends: 4542 [2019-12-18 19:56:21,844 INFO L226 Difference]: Without dead ends: 800 [2019-12-18 19:56:21,845 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:56:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-12-18 19:56:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-12-18 19:56:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-12-18 19:56:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1671 transitions. [2019-12-18 19:56:21,857 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1671 transitions. Word has length 47 [2019-12-18 19:56:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:21,858 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1671 transitions. [2019-12-18 19:56:21,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:56:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1671 transitions. [2019-12-18 19:56:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 19:56:21,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:21,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:21,865 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:21,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1549401206, now seen corresponding path program 1 times [2019-12-18 19:56:21,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:21,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548694027] [2019-12-18 19:56:21,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:21,964 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:56:21,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548694027] [2019-12-18 19:56:21,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:21,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:56:21,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077174854] [2019-12-18 19:56:21,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:56:21,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:21,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:56:21,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:56:21,966 INFO L87 Difference]: Start difference. First operand 774 states and 1671 transitions. Second operand 8 states. [2019-12-18 19:56:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:22,226 INFO L93 Difference]: Finished difference Result 1441 states and 3041 transitions. [2019-12-18 19:56:22,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:56:22,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-18 19:56:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:22,228 INFO L225 Difference]: With dead ends: 1441 [2019-12-18 19:56:22,228 INFO L226 Difference]: Without dead ends: 1081 [2019-12-18 19:56:22,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:56:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-12-18 19:56:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 877. [2019-12-18 19:56:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-12-18 19:56:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1862 transitions. [2019-12-18 19:56:22,240 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1862 transitions. Word has length 62 [2019-12-18 19:56:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:22,240 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1862 transitions. [2019-12-18 19:56:22,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:56:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1862 transitions. [2019-12-18 19:56:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 19:56:22,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:22,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:22,242 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1783952234, now seen corresponding path program 2 times [2019-12-18 19:56:22,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:22,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256076890] [2019-12-18 19:56:22,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:22,350 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:56:22,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256076890] [2019-12-18 19:56:22,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:22,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:56:22,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335526531] [2019-12-18 19:56:22,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:56:22,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:22,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:56:22,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:56:22,354 INFO L87 Difference]: Start difference. First operand 877 states and 1862 transitions. Second operand 6 states. [2019-12-18 19:56:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:22,771 INFO L93 Difference]: Finished difference Result 998 states and 2098 transitions. [2019-12-18 19:56:22,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:56:22,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-18 19:56:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:22,773 INFO L225 Difference]: With dead ends: 998 [2019-12-18 19:56:22,773 INFO L226 Difference]: Without dead ends: 998 [2019-12-18 19:56:22,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:56:22,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-12-18 19:56:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 883. [2019-12-18 19:56:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-18 19:56:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1873 transitions. [2019-12-18 19:56:22,789 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1873 transitions. Word has length 62 [2019-12-18 19:56:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:22,789 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1873 transitions. [2019-12-18 19:56:22,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:56:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1873 transitions. [2019-12-18 19:56:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 19:56:22,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:22,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:22,791 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1868045874, now seen corresponding path program 3 times [2019-12-18 19:56:22,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:22,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440447149] [2019-12-18 19:56:22,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:22,867 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:56:22,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440447149] [2019-12-18 19:56:22,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:22,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:56:22,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098112380] [2019-12-18 19:56:22,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:56:22,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:22,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:56:22,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:56:22,870 INFO L87 Difference]: Start difference. First operand 883 states and 1873 transitions. Second operand 3 states. [2019-12-18 19:56:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:22,886 INFO L93 Difference]: Finished difference Result 883 states and 1872 transitions. [2019-12-18 19:56:22,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:56:22,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-18 19:56:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:22,889 INFO L225 Difference]: With dead ends: 883 [2019-12-18 19:56:22,889 INFO L226 Difference]: Without dead ends: 883 [2019-12-18 19:56:22,890 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:56:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-18 19:56:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 801. [2019-12-18 19:56:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-12-18 19:56:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1717 transitions. [2019-12-18 19:56:22,904 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1717 transitions. Word has length 62 [2019-12-18 19:56:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:22,904 INFO L462 AbstractCegarLoop]: Abstraction has 801 states and 1717 transitions. [2019-12-18 19:56:22,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:56:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1717 transitions. [2019-12-18 19:56:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 19:56:22,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:22,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:22,907 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:22,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1377954014, now seen corresponding path program 1 times [2019-12-18 19:56:22,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:22,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836209947] [2019-12-18 19:56:22,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:56:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:56:23,081 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:56:23,082 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:56:23,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~y$w_buff1_used~0_73 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t23~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t23~0.base_24|) |v_ULTIMATE.start_main_~#t23~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p1_EAX~0_13) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~y$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t23~0.base_24|) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$r_buff1_thd2~0_31) (= v_~__unbuffered_p1_EBX~0_14 0) (= v_~y$read_delayed~0_7 0) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t23~0.base_24| 1)) (= v_~main$tmp_guard0~0_12 0) (= v_~y~0_30 0) (= v_~y$r_buff0_thd1~0_9 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_31) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff1_thd1~0_9 0) (= v_~y$r_buff0_thd3~0_76 0) (= 0 v_~y$flush_delayed~0_18) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~y$w_buff0~0_37) (= v_~y$r_buff0_thd0~0_21 0) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t23~0.base_24| 4) |v_#length_25|) (= |v_#NULL.offset_5| 0) (= v_~y$r_buff0_thd2~0_55 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= (select .cse0 |v_ULTIMATE.start_main_~#t23~0.base_24|) 0) (= 0 v_~z~0_9) (= |v_ULTIMATE.start_main_~#t23~0.offset_19| 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~y$w_buff0_used~0_133 0) (= v_~__unbuffered_p0_EBX~0_16 0) (= 0 v_~y$r_buff1_thd3~0_39) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_~#t25~0.base=|v_ULTIMATE.start_main_~#t25~0.base_19|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ULTIMATE.start_main_~#t25~0.offset=|v_ULTIMATE.start_main_~#t25~0.offset_16|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_25|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~y$w_buff1~0=v_~y$w_buff1~0_31, ~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_55, ULTIMATE.start_main_~#t24~0.base=|v_ULTIMATE.start_main_~#t24~0.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ~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_133, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_~#t23~0.base=|v_ULTIMATE.start_main_~#t23~0.base_24|, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_76, ~y~0=v_~y~0_30, ULTIMATE.start_main_~#t24~0.offset=|v_ULTIMATE.start_main_~#t24~0.offset_16|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_31, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_11|, ULTIMATE.start_main_~#t23~0.offset=|v_ULTIMATE.start_main_~#t23~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t25~0.base, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t25~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t24~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t23~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t24~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t23~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:56:23,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t24~0.base_11|) (= |v_ULTIMATE.start_main_~#t24~0.offset_10| 0) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t24~0.base_11| 1) |v_#valid_32|) (not (= |v_ULTIMATE.start_main_~#t24~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t24~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t24~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t24~0.base_11|) |v_ULTIMATE.start_main_~#t24~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t24~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t24~0.offset=|v_ULTIMATE.start_main_~#t24~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t24~0.base=|v_ULTIMATE.start_main_~#t24~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t24~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t24~0.base, #length] because there is no mapped edge [2019-12-18 19:56:23,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t25~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t25~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t25~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t25~0.base_11|) |v_ULTIMATE.start_main_~#t25~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t25~0.base_11| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t25~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t25~0.offset_10| 0) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t25~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t25~0.base=|v_ULTIMATE.start_main_~#t25~0.base_11|, ULTIMATE.start_main_~#t25~0.offset=|v_ULTIMATE.start_main_~#t25~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t25~0.base, ULTIMATE.start_main_~#t25~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-18 19:56:23,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= v_~y$w_buff0~0_26 v_~y$w_buff1~0_21) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= 1 v_~y$w_buff0~0_25) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff0_used~0_104 1) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_105)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff0~0=v_~y$w_buff0~0_26, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_25, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:56:23,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In112998524 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In112998524 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out112998524| ~y$w_buff0~0_In112998524)) (and (or .cse0 .cse1) (= ~y$w_buff1~0_In112998524 |P2Thread1of1ForFork0_#t~ite28_Out112998524|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In112998524, ~y$w_buff1~0=~y$w_buff1~0_In112998524, ~y$w_buff0~0=~y$w_buff0~0_In112998524, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In112998524} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out112998524|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In112998524, ~y$w_buff1~0=~y$w_buff1~0_In112998524, ~y$w_buff0~0=~y$w_buff0~0_In112998524, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In112998524} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 19:56:23,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_18 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-18 19:56:23,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_46 v_~y$r_buff0_thd3~0_45) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 19:56:23,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1985802944 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1985802944 |P2Thread1of1ForFork0_#t~ite48_Out-1985802944|)) (and .cse0 (= ~y~0_In-1985802944 |P2Thread1of1ForFork0_#t~ite48_Out-1985802944|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1985802944, ~y$flush_delayed~0=~y$flush_delayed~0_In-1985802944, ~y~0=~y~0_In-1985802944} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1985802944|, ~y$mem_tmp~0=~y$mem_tmp~0_In-1985802944, ~y$flush_delayed~0=~y$flush_delayed~0_In-1985802944, ~y~0=~y~0_In-1985802944} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 19:56:23,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 1 v_~z~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~__unbuffered_p0_EBX~0_7 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~z~0_5)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z~0=v_~z~0_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 19:56:23,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1890964129 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1890964129 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1890964129|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out1890964129| ~y$w_buff0_used~0_In1890964129)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1890964129, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1890964129} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1890964129, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1890964129, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1890964129|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 19:56:23,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In933649158 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In933649158 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In933649158 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In933649158 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out933649158| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite52_Out933649158| ~y$w_buff1_used~0_In933649158)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In933649158, ~y$w_buff0_used~0=~y$w_buff0_used~0_In933649158, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In933649158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In933649158} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In933649158, ~y$w_buff0_used~0=~y$w_buff0_used~0_In933649158, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In933649158, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out933649158|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In933649158} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 19:56:23,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-902437080 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-902437080 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out-902437080 ~y$r_buff0_thd3~0_In-902437080) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd3~0_Out-902437080 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-902437080, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-902437080} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-902437080, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-902437080, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-902437080|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 19:56:23,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-343952508 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-343952508 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-343952508 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-343952508 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In-343952508 |P2Thread1of1ForFork0_#t~ite54_Out-343952508|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out-343952508| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-343952508, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-343952508, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-343952508, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-343952508} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-343952508, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-343952508, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-343952508|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-343952508, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-343952508} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 19:56:23,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~y$r_buff1_thd3~0_33 |v_P2Thread1of1ForFork0_#t~ite54_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 19:56:23,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1467617972 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1467617972 |P1Thread1of1ForFork2_#t~ite25_Out-1467617972|)) (and .cse0 (= ~y~0_In-1467617972 |P1Thread1of1ForFork2_#t~ite25_Out-1467617972|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1467617972, ~y$flush_delayed~0=~y$flush_delayed~0_In-1467617972, ~y~0=~y~0_In-1467617972} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1467617972, ~y$flush_delayed~0=~y$flush_delayed~0_In-1467617972, ~y~0=~y~0_In-1467617972, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1467617972|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 19:56:23,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L773-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~y~0_25) (= 0 v_~y$flush_delayed~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_25, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 19:56:23,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_93 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 19:56:23,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1182572410 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite58_Out1182572410| |ULTIMATE.start_main_#t~ite59_Out1182572410|)) (.cse2 (= (mod ~y$w_buff1_used~0_In1182572410 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out1182572410| ~y~0_In1182572410) .cse0 (or .cse1 .cse2)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out1182572410| ~y$w_buff1~0_In1182572410) .cse0 (not .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1182572410, ~y~0=~y~0_In1182572410, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1182572410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1182572410} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1182572410, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1182572410|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1182572410|, ~y~0=~y~0_In1182572410, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1182572410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1182572410} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 19:56:23,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1996106730 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1996106730 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-1996106730| 0)) (and (= ~y$w_buff0_used~0_In-1996106730 |ULTIMATE.start_main_#t~ite60_Out-1996106730|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996106730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1996106730} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1996106730|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996106730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1996106730} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 19:56:23,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1348746898 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1348746898 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1348746898 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1348746898 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1348746898| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite61_Out1348746898| ~y$w_buff1_used~0_In1348746898)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1348746898, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1348746898, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1348746898, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1348746898} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1348746898|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1348746898, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1348746898, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1348746898, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1348746898} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 19:56:23,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1711641209 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1711641209 256)))) (or (and (= ~y$r_buff0_thd0~0_In-1711641209 |ULTIMATE.start_main_#t~ite62_Out-1711641209|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1711641209| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1711641209, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1711641209} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1711641209|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1711641209, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1711641209} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 19:56:23,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In2118300752 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2118300752 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In2118300752 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In2118300752 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out2118300752| ~y$r_buff1_thd0~0_In2118300752) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite63_Out2118300752|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2118300752, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2118300752, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2118300752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2118300752} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out2118300752|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2118300752, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2118300752, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2118300752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2118300752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 19:56:23,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_6) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_7) (= v_~__unbuffered_p2_EBX~0_7 0) (= |v_ULTIMATE.start_main_#t~ite63_11| v_~y$r_buff1_thd0~0_17)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:56:23,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:56:23 BasicIcfg [2019-12-18 19:56:23,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:56:23,280 INFO L168 Benchmark]: Toolchain (without parser) took 68381.70 ms. Allocated memory was 136.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.3 MB in the beginning and 1.1 GB in the end (delta: -966.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 19:56:23,280 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 19:56:23,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.97 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 98.9 MB in the beginning and 150.4 MB in the end (delta: -51.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-12-18 19:56:23,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.44 ms. Allocated memory is still 200.3 MB. Free memory was 150.4 MB in the beginning and 147.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:56:23,286 INFO L168 Benchmark]: Boogie Preprocessor took 41.79 ms. Allocated memory is still 200.3 MB. Free memory was 147.3 MB in the beginning and 145.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:56:23,287 INFO L168 Benchmark]: RCFGBuilder took 940.20 ms. Allocated memory is still 200.3 MB. Free memory was 145.2 MB in the beginning and 89.5 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:56:23,287 INFO L168 Benchmark]: TraceAbstraction took 66475.78 ms. Allocated memory was 200.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 88.4 MB in the beginning and 1.1 GB in the end (delta: -977.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 19:56:23,296 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 840.97 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 98.9 MB in the beginning and 150.4 MB in the end (delta: -51.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.44 ms. Allocated memory is still 200.3 MB. Free memory was 150.4 MB in the beginning and 147.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.79 ms. Allocated memory is still 200.3 MB. Free memory was 147.3 MB in the beginning and 145.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 940.20 ms. Allocated memory is still 200.3 MB. Free memory was 145.2 MB in the beginning and 89.5 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66475.78 ms. Allocated memory was 200.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 88.4 MB in the beginning and 1.1 GB in the end (delta: -977.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 197 ProgramPointsBefore, 107 ProgramPointsAfterwards, 243 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 30 ChoiceCompositions, 9080 VarBasedMoverChecksPositive, 248 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 134958 CheckedPairsTotal, 125 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t23, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t24, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t25, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L804] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L805] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] 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) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 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 [L765] 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) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 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)) [L767] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 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)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 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)) [L769] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 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)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 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)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 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 [L853] 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, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 66.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3319 SDtfs, 3472 SDslu, 5188 SDs, 0 SdLazy, 1946 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126591occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 51178 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 583 ConstructedInterpolants, 0 QuantifiedInterpolants, 72286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...