/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/mix005_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:06:59,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:06:59,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:06:59,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:06:59,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:06:59,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:06:59,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:06:59,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:06:59,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:06:59,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:06:59,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:06:59,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:06:59,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:06:59,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:06:59,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:06:59,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:06:59,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:06:59,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:06:59,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:06:59,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:06:59,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:06:59,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:06:59,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:06:59,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:06:59,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:06:59,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:06:59,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:06:59,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:06:59,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:06:59,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:06:59,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:06:59,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:06:59,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:06:59,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:06:59,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:06:59,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:06:59,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:06:59,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:06:59,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:06:59,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:06:59,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:06:59,725 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-27 05:06:59,757 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:06:59,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:06:59,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:06:59,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:06:59,761 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:06:59,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:06:59,762 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:06:59,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:06:59,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:06:59,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:06:59,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:06:59,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:06:59,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:06:59,765 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:06:59,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:06:59,766 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:06:59,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:06:59,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:06:59,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:06:59,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:06:59,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:06:59,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:06:59,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:06:59,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:06:59,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:06:59,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:06:59,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:06:59,768 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:06:59,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:06:59,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:07:00,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:07:00,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:07:00,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:07:00,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:07:00,077 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:07:00,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_pso.opt.i [2019-12-27 05:07:00,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/792b7ecbd/e858a9a3293046bab487c97dd3fd5021/FLAG09755adf5 [2019-12-27 05:07:00,702 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:07:00,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_pso.opt.i [2019-12-27 05:07:00,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/792b7ecbd/e858a9a3293046bab487c97dd3fd5021/FLAG09755adf5 [2019-12-27 05:07:01,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/792b7ecbd/e858a9a3293046bab487c97dd3fd5021 [2019-12-27 05:07:01,042 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:07:01,044 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:07:01,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:07:01,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:07:01,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:07:01,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:07:01" (1/1) ... [2019-12-27 05:07:01,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75213e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:01, skipping insertion in model container [2019-12-27 05:07:01,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:07:01" (1/1) ... [2019-12-27 05:07:01,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:07:01,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:07:01,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:07:01,839 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:07:01,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:07:02,043 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:07:02,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02 WrapperNode [2019-12-27 05:07:02,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:07:02,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:07:02,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:07:02,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:07:02,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02" (1/1) ... [2019-12-27 05:07:02,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02" (1/1) ... [2019-12-27 05:07:02,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:07:02,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:07:02,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:07:02,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:07:02,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02" (1/1) ... [2019-12-27 05:07:02,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02" (1/1) ... [2019-12-27 05:07:02,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02" (1/1) ... [2019-12-27 05:07:02,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02" (1/1) ... [2019-12-27 05:07:02,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02" (1/1) ... [2019-12-27 05:07:02,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02" (1/1) ... [2019-12-27 05:07:02,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02" (1/1) ... [2019-12-27 05:07:02,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:07:02,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:07:02,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:07:02,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:07:02,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:07:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:07:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:07:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:07:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:07:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:07:02,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:07:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:07:02,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:07:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:07:02,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:07:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 05:07:02,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 05:07:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:07:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:07:02,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:07:02,306 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:07:03,179 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:07:03,180 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:07:03,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:07:03 BoogieIcfgContainer [2019-12-27 05:07:03,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:07:03,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:07:03,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:07:03,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:07:03,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:07:01" (1/3) ... [2019-12-27 05:07:03,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f20b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:07:03, skipping insertion in model container [2019-12-27 05:07:03,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:07:02" (2/3) ... [2019-12-27 05:07:03,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f20b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:07:03, skipping insertion in model container [2019-12-27 05:07:03,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:07:03" (3/3) ... [2019-12-27 05:07:03,190 INFO L109 eAbstractionObserver]: Analyzing ICFG mix005_pso.opt.i [2019-12-27 05:07:03,199 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:07:03,199 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:07:03,206 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:07:03,207 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:07:03,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,251 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,252 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,254 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,254 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,275 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,275 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,275 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,276 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,276 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,301 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,302 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,306 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,308 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,314 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,315 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,317 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,320 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:07:03,336 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 05:07:03,357 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:07:03,357 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:07:03,357 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:07:03,357 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:07:03,357 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:07:03,358 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:07:03,358 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:07:03,358 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:07:03,383 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-27 05:07:03,385 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-27 05:07:03,509 INFO L132 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-27 05:07:03,510 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:07:03,531 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 0/193 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-27 05:07:03,566 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-27 05:07:03,639 INFO L132 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-27 05:07:03,639 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:07:03,653 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 0/193 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-27 05:07:03,688 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-27 05:07:03,689 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:07:07,203 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-27 05:07:07,583 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:07:07,723 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:07:08,063 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 05:07:08,214 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 05:07:08,245 INFO L206 etLargeBlockEncoding]: Checked pairs total: 148368 [2019-12-27 05:07:08,245 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-27 05:07:08,248 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-27 05:07:18,863 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 93038 states. [2019-12-27 05:07:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 93038 states. [2019-12-27 05:07:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 05:07:18,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:07:18,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:07:18,872 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:07:18,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:07:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash -219848509, now seen corresponding path program 1 times [2019-12-27 05:07:18,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:07:18,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905154394] [2019-12-27 05:07:18,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:07:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:07:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:07:19,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905154394] [2019-12-27 05:07:19,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:07:19,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:07:19,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485585749] [2019-12-27 05:07:19,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:07:19,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:07:19,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:07:19,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:07:19,168 INFO L87 Difference]: Start difference. First operand 93038 states. Second operand 3 states. [2019-12-27 05:07:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:07:22,733 INFO L93 Difference]: Finished difference Result 92046 states and 422416 transitions. [2019-12-27 05:07:22,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:07:22,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 05:07:22,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:07:23,344 INFO L225 Difference]: With dead ends: 92046 [2019-12-27 05:07:23,345 INFO L226 Difference]: Without dead ends: 85710 [2019-12-27 05:07:23,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:07:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85710 states. [2019-12-27 05:07:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85710 to 85710. [2019-12-27 05:07:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85710 states. [2019-12-27 05:07:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85710 states to 85710 states and 393088 transitions. [2019-12-27 05:07:30,224 INFO L78 Accepts]: Start accepts. Automaton has 85710 states and 393088 transitions. Word has length 9 [2019-12-27 05:07:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:07:30,225 INFO L462 AbstractCegarLoop]: Abstraction has 85710 states and 393088 transitions. [2019-12-27 05:07:30,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:07:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 85710 states and 393088 transitions. [2019-12-27 05:07:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 05:07:30,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:07:30,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:07:30,239 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:07:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:07:30,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1999056324, now seen corresponding path program 1 times [2019-12-27 05:07:30,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:07:30,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389589212] [2019-12-27 05:07:30,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:07:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:07:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:07:30,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389589212] [2019-12-27 05:07:30,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:07:30,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:07:30,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074210461] [2019-12-27 05:07:30,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:07:30,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:07:30,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:07:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:07:30,373 INFO L87 Difference]: Start difference. First operand 85710 states and 393088 transitions. Second operand 4 states. [2019-12-27 05:07:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:07:34,452 INFO L93 Difference]: Finished difference Result 135910 states and 601052 transitions. [2019-12-27 05:07:34,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:07:34,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 05:07:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:07:35,680 INFO L225 Difference]: With dead ends: 135910 [2019-12-27 05:07:35,681 INFO L226 Difference]: Without dead ends: 135838 [2019-12-27 05:07:35,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:07:37,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135838 states. [2019-12-27 05:07:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135838 to 132030. [2019-12-27 05:07:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132030 states. [2019-12-27 05:07:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132030 states to 132030 states and 587252 transitions. [2019-12-27 05:07:46,341 INFO L78 Accepts]: Start accepts. Automaton has 132030 states and 587252 transitions. Word has length 15 [2019-12-27 05:07:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:07:46,341 INFO L462 AbstractCegarLoop]: Abstraction has 132030 states and 587252 transitions. [2019-12-27 05:07:46,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:07:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 132030 states and 587252 transitions. [2019-12-27 05:07:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 05:07:46,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:07:46,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:07:46,349 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:07:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:07:46,350 INFO L82 PathProgramCache]: Analyzing trace with hash 960194978, now seen corresponding path program 1 times [2019-12-27 05:07:46,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:07:46,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503885472] [2019-12-27 05:07:46,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:07:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:07:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:07:46,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503885472] [2019-12-27 05:07:46,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:07:46,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:07:46,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623588308] [2019-12-27 05:07:46,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:07:46,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:07:46,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:07:46,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:07:46,496 INFO L87 Difference]: Start difference. First operand 132030 states and 587252 transitions. Second operand 4 states. [2019-12-27 05:07:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:07:52,336 INFO L93 Difference]: Finished difference Result 167330 states and 735532 transitions. [2019-12-27 05:07:52,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:07:52,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 05:07:52,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:07:52,909 INFO L225 Difference]: With dead ends: 167330 [2019-12-27 05:07:52,909 INFO L226 Difference]: Without dead ends: 167270 [2019-12-27 05:07:52,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:07:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167270 states. [2019-12-27 05:07:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167270 to 149078. [2019-12-27 05:07:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149078 states. [2019-12-27 05:07:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149078 states to 149078 states and 660916 transitions. [2019-12-27 05:07:59,662 INFO L78 Accepts]: Start accepts. Automaton has 149078 states and 660916 transitions. Word has length 18 [2019-12-27 05:07:59,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:07:59,663 INFO L462 AbstractCegarLoop]: Abstraction has 149078 states and 660916 transitions. [2019-12-27 05:07:59,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:07:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 149078 states and 660916 transitions. [2019-12-27 05:07:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 05:07:59,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:07:59,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:07:59,682 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:07:59,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:07:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1006978459, now seen corresponding path program 1 times [2019-12-27 05:07:59,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:07:59,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391895171] [2019-12-27 05:07:59,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:07:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:07:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:07:59,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391895171] [2019-12-27 05:07:59,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:07:59,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:07:59,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146317186] [2019-12-27 05:07:59,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:07:59,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:07:59,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:07:59,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:07:59,764 INFO L87 Difference]: Start difference. First operand 149078 states and 660916 transitions. Second operand 3 states. [2019-12-27 05:08:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:08:05,497 INFO L93 Difference]: Finished difference Result 145939 states and 643818 transitions. [2019-12-27 05:08:05,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:08:05,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 05:08:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:08:06,021 INFO L225 Difference]: With dead ends: 145939 [2019-12-27 05:08:06,021 INFO L226 Difference]: Without dead ends: 145939 [2019-12-27 05:08:06,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:08:08,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145939 states. [2019-12-27 05:08:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145939 to 145939. [2019-12-27 05:08:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145939 states. [2019-12-27 05:08:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145939 states to 145939 states and 643818 transitions. [2019-12-27 05:08:15,818 INFO L78 Accepts]: Start accepts. Automaton has 145939 states and 643818 transitions. Word has length 20 [2019-12-27 05:08:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:08:15,818 INFO L462 AbstractCegarLoop]: Abstraction has 145939 states and 643818 transitions. [2019-12-27 05:08:15,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:08:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 145939 states and 643818 transitions. [2019-12-27 05:08:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 05:08:15,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:08:15,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:08:15,835 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:08:15,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:08:15,835 INFO L82 PathProgramCache]: Analyzing trace with hash -776205731, now seen corresponding path program 1 times [2019-12-27 05:08:15,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:08:15,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032873225] [2019-12-27 05:08:15,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:08:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:08:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:08:15,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032873225] [2019-12-27 05:08:15,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:08:15,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:08:15,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667989127] [2019-12-27 05:08:15,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:08:15,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:08:15,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:08:15,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:08:15,940 INFO L87 Difference]: Start difference. First operand 145939 states and 643818 transitions. Second operand 3 states. [2019-12-27 05:08:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:08:17,666 INFO L93 Difference]: Finished difference Result 180068 states and 754679 transitions. [2019-12-27 05:08:17,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:08:17,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 05:08:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:08:18,124 INFO L225 Difference]: With dead ends: 180068 [2019-12-27 05:08:18,124 INFO L226 Difference]: Without dead ends: 146514 [2019-12-27 05:08:18,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:08:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146514 states. [2019-12-27 05:08:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146514 to 143325. [2019-12-27 05:08:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143325 states. [2019-12-27 05:08:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143325 states to 143325 states and 597576 transitions. [2019-12-27 05:08:30,188 INFO L78 Accepts]: Start accepts. Automaton has 143325 states and 597576 transitions. Word has length 21 [2019-12-27 05:08:30,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:08:30,188 INFO L462 AbstractCegarLoop]: Abstraction has 143325 states and 597576 transitions. [2019-12-27 05:08:30,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:08:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand 143325 states and 597576 transitions. [2019-12-27 05:08:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 05:08:30,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:08:30,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:08:30,203 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:08:30,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:08:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1300239832, now seen corresponding path program 1 times [2019-12-27 05:08:30,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:08:30,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684743458] [2019-12-27 05:08:30,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:08:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:08:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:08:30,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684743458] [2019-12-27 05:08:30,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:08:30,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:08:30,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475378632] [2019-12-27 05:08:30,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:08:30,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:08:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:08:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:08:30,258 INFO L87 Difference]: Start difference. First operand 143325 states and 597576 transitions. Second operand 3 states. [2019-12-27 05:08:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:08:31,137 INFO L93 Difference]: Finished difference Result 143151 states and 596933 transitions. [2019-12-27 05:08:31,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:08:31,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 05:08:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:08:36,947 INFO L225 Difference]: With dead ends: 143151 [2019-12-27 05:08:36,947 INFO L226 Difference]: Without dead ends: 143151 [2019-12-27 05:08:36,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:08:38,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143151 states. [2019-12-27 05:08:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143151 to 143151. [2019-12-27 05:08:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143151 states. [2019-12-27 05:08:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143151 states to 143151 states and 596933 transitions. [2019-12-27 05:08:41,460 INFO L78 Accepts]: Start accepts. Automaton has 143151 states and 596933 transitions. Word has length 21 [2019-12-27 05:08:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:08:41,460 INFO L462 AbstractCegarLoop]: Abstraction has 143151 states and 596933 transitions. [2019-12-27 05:08:41,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:08:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 143151 states and 596933 transitions. [2019-12-27 05:08:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:08:41,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:08:41,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:08:41,479 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:08:41,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:08:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash -338694234, now seen corresponding path program 1 times [2019-12-27 05:08:41,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:08:41,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191007946] [2019-12-27 05:08:41,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:08:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:08:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:08:41,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191007946] [2019-12-27 05:08:41,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:08:41,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:08:41,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459705004] [2019-12-27 05:08:41,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:08:41,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:08:41,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:08:41,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:08:41,538 INFO L87 Difference]: Start difference. First operand 143151 states and 596933 transitions. Second operand 4 states. [2019-12-27 05:08:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:08:43,563 INFO L93 Difference]: Finished difference Result 210250 states and 827736 transitions. [2019-12-27 05:08:43,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:08:43,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-27 05:08:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:08:43,756 INFO L225 Difference]: With dead ends: 210250 [2019-12-27 05:08:43,756 INFO L226 Difference]: Without dead ends: 79302 [2019-12-27 05:08:43,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:08:44,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79302 states. [2019-12-27 05:08:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79302 to 78186. [2019-12-27 05:08:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78186 states. [2019-12-27 05:08:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78186 states to 78186 states and 272476 transitions. [2019-12-27 05:08:51,718 INFO L78 Accepts]: Start accepts. Automaton has 78186 states and 272476 transitions. Word has length 22 [2019-12-27 05:08:51,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:08:51,719 INFO L462 AbstractCegarLoop]: Abstraction has 78186 states and 272476 transitions. [2019-12-27 05:08:51,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:08:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 78186 states and 272476 transitions. [2019-12-27 05:08:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:08:51,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:08:51,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:08:51,728 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:08:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:08:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1675693570, now seen corresponding path program 2 times [2019-12-27 05:08:51,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:08:51,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627536686] [2019-12-27 05:08:51,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:08:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:08:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:08:51,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627536686] [2019-12-27 05:08:51,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:08:51,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:08:51,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150827547] [2019-12-27 05:08:51,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:08:51,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:08:51,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:08:51,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:08:51,795 INFO L87 Difference]: Start difference. First operand 78186 states and 272476 transitions. Second operand 3 states. [2019-12-27 05:08:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:08:52,656 INFO L93 Difference]: Finished difference Result 73900 states and 255147 transitions. [2019-12-27 05:08:52,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:08:52,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 05:08:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:08:52,847 INFO L225 Difference]: With dead ends: 73900 [2019-12-27 05:08:52,848 INFO L226 Difference]: Without dead ends: 73684 [2019-12-27 05:08:52,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:08:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73684 states. [2019-12-27 05:08:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73684 to 73468. [2019-12-27 05:08:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73468 states. [2019-12-27 05:08:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73468 states to 73468 states and 253875 transitions. [2019-12-27 05:08:55,255 INFO L78 Accepts]: Start accepts. Automaton has 73468 states and 253875 transitions. Word has length 22 [2019-12-27 05:08:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:08:55,255 INFO L462 AbstractCegarLoop]: Abstraction has 73468 states and 253875 transitions. [2019-12-27 05:08:55,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:08:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 73468 states and 253875 transitions. [2019-12-27 05:08:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 05:08:55,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:08:55,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:08:55,267 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:08:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:08:55,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2098624475, now seen corresponding path program 1 times [2019-12-27 05:08:55,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:08:55,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867096439] [2019-12-27 05:08:55,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:08:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:08:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:08:55,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867096439] [2019-12-27 05:08:55,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:08:55,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:08:55,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835524973] [2019-12-27 05:08:55,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:08:55,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:08:55,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:08:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:08:55,344 INFO L87 Difference]: Start difference. First operand 73468 states and 253875 transitions. Second operand 5 states. [2019-12-27 05:08:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:08:56,336 INFO L93 Difference]: Finished difference Result 87478 states and 296814 transitions. [2019-12-27 05:08:56,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:08:56,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 05:08:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:08:56,512 INFO L225 Difference]: With dead ends: 87478 [2019-12-27 05:08:56,512 INFO L226 Difference]: Without dead ends: 85842 [2019-12-27 05:08:56,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:08:58,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85842 states. [2019-12-27 05:08:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85842 to 71222. [2019-12-27 05:08:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71222 states. [2019-12-27 05:08:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71222 states to 71222 states and 245537 transitions. [2019-12-27 05:08:59,195 INFO L78 Accepts]: Start accepts. Automaton has 71222 states and 245537 transitions. Word has length 24 [2019-12-27 05:08:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:08:59,196 INFO L462 AbstractCegarLoop]: Abstraction has 71222 states and 245537 transitions. [2019-12-27 05:08:59,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:08:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 71222 states and 245537 transitions. [2019-12-27 05:08:59,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 05:08:59,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:08:59,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:08:59,270 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:08:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:08:59,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1881257346, now seen corresponding path program 1 times [2019-12-27 05:08:59,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:08:59,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274525649] [2019-12-27 05:08:59,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:08:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:08:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:08:59,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274525649] [2019-12-27 05:08:59,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:08:59,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:08:59,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531589358] [2019-12-27 05:08:59,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:08:59,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:08:59,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:08:59,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:08:59,330 INFO L87 Difference]: Start difference. First operand 71222 states and 245537 transitions. Second operand 3 states. [2019-12-27 05:09:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:00,391 INFO L93 Difference]: Finished difference Result 71222 states and 242269 transitions. [2019-12-27 05:09:00,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:09:00,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-27 05:09:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:00,533 INFO L225 Difference]: With dead ends: 71222 [2019-12-27 05:09:00,533 INFO L226 Difference]: Without dead ends: 71222 [2019-12-27 05:09:00,534 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-27 05:09:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71222 states. [2019-12-27 05:09:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71222 to 71046. [2019-12-27 05:09:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71046 states. [2019-12-27 05:09:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71046 states to 71046 states and 241801 transitions. [2019-12-27 05:09:05,094 INFO L78 Accepts]: Start accepts. Automaton has 71046 states and 241801 transitions. Word has length 36 [2019-12-27 05:09:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:09:05,094 INFO L462 AbstractCegarLoop]: Abstraction has 71046 states and 241801 transitions. [2019-12-27 05:09:05,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:09:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 71046 states and 241801 transitions. [2019-12-27 05:09:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:09:05,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:05,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:09:05,157 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1678028845, now seen corresponding path program 1 times [2019-12-27 05:09:05,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:05,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830293398] [2019-12-27 05:09:05,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:09:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:09:05,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830293398] [2019-12-27 05:09:05,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:09:05,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:09:05,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329731928] [2019-12-27 05:09:05,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:09:05,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:09:05,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:09:05,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:09:05,255 INFO L87 Difference]: Start difference. First operand 71046 states and 241801 transitions. Second operand 7 states. [2019-12-27 05:09:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:06,692 INFO L93 Difference]: Finished difference Result 181532 states and 617388 transitions. [2019-12-27 05:09:06,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 05:09:06,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 05:09:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:07,678 INFO L225 Difference]: With dead ends: 181532 [2019-12-27 05:09:07,678 INFO L226 Difference]: Without dead ends: 149624 [2019-12-27 05:09:07,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:09:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149624 states. [2019-12-27 05:09:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149624 to 115350. [2019-12-27 05:09:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115350 states. [2019-12-27 05:09:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115350 states to 115350 states and 398708 transitions. [2019-12-27 05:09:11,066 INFO L78 Accepts]: Start accepts. Automaton has 115350 states and 398708 transitions. Word has length 37 [2019-12-27 05:09:11,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:09:11,066 INFO L462 AbstractCegarLoop]: Abstraction has 115350 states and 398708 transitions. [2019-12-27 05:09:11,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:09:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 115350 states and 398708 transitions. [2019-12-27 05:09:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:09:11,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:11,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:09:11,939 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:11,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1355430725, now seen corresponding path program 2 times [2019-12-27 05:09:11,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:11,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239252223] [2019-12-27 05:09:11,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:09:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:09:12,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239252223] [2019-12-27 05:09:12,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:09:12,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:09:12,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557684734] [2019-12-27 05:09:12,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:09:12,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:09:12,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:09:12,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:09:12,102 INFO L87 Difference]: Start difference. First operand 115350 states and 398708 transitions. Second operand 9 states. [2019-12-27 05:09:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:14,282 INFO L93 Difference]: Finished difference Result 169602 states and 591650 transitions. [2019-12-27 05:09:14,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:09:14,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-27 05:09:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:14,649 INFO L225 Difference]: With dead ends: 169602 [2019-12-27 05:09:14,649 INFO L226 Difference]: Without dead ends: 157394 [2019-12-27 05:09:14,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:09:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157394 states. [2019-12-27 05:09:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157394 to 123442. [2019-12-27 05:09:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123442 states. [2019-12-27 05:09:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123442 states to 123442 states and 428864 transitions. [2019-12-27 05:09:19,545 INFO L78 Accepts]: Start accepts. Automaton has 123442 states and 428864 transitions. Word has length 37 [2019-12-27 05:09:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:09:19,546 INFO L462 AbstractCegarLoop]: Abstraction has 123442 states and 428864 transitions. [2019-12-27 05:09:19,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:09:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 123442 states and 428864 transitions. [2019-12-27 05:09:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:09:19,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:19,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:09:19,669 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:19,670 INFO L82 PathProgramCache]: Analyzing trace with hash -830829175, now seen corresponding path program 3 times [2019-12-27 05:09:19,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:19,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66209631] [2019-12-27 05:09:19,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:09:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:09:19,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66209631] [2019-12-27 05:09:19,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:09:19,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:09:19,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992813095] [2019-12-27 05:09:19,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:09:19,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:09:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:09:19,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:09:19,775 INFO L87 Difference]: Start difference. First operand 123442 states and 428864 transitions. Second operand 8 states. [2019-12-27 05:09:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:21,676 INFO L93 Difference]: Finished difference Result 213704 states and 737724 transitions. [2019-12-27 05:09:21,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 05:09:21,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-27 05:09:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:22,113 INFO L225 Difference]: With dead ends: 213704 [2019-12-27 05:09:22,113 INFO L226 Difference]: Without dead ends: 196784 [2019-12-27 05:09:22,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:09:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196784 states. [2019-12-27 05:09:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196784 to 122630. [2019-12-27 05:09:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122630 states. [2019-12-27 05:09:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122630 states to 122630 states and 425514 transitions. [2019-12-27 05:09:30,981 INFO L78 Accepts]: Start accepts. Automaton has 122630 states and 425514 transitions. Word has length 37 [2019-12-27 05:09:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:09:30,982 INFO L462 AbstractCegarLoop]: Abstraction has 122630 states and 425514 transitions. [2019-12-27 05:09:30,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:09:30,982 INFO L276 IsEmpty]: Start isEmpty. Operand 122630 states and 425514 transitions. [2019-12-27 05:09:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:09:31,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:31,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:09:31,095 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:31,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:31,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1270340269, now seen corresponding path program 4 times [2019-12-27 05:09:31,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:31,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912548987] [2019-12-27 05:09:31,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:09:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:09:31,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912548987] [2019-12-27 05:09:31,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:09:31,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:09:31,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680628229] [2019-12-27 05:09:31,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:09:31,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:09:31,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:09:31,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:09:31,178 INFO L87 Difference]: Start difference. First operand 122630 states and 425514 transitions. Second operand 7 states. [2019-12-27 05:09:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:32,855 INFO L93 Difference]: Finished difference Result 209790 states and 724756 transitions. [2019-12-27 05:09:32,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 05:09:32,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 05:09:32,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:34,312 INFO L225 Difference]: With dead ends: 209790 [2019-12-27 05:09:34,312 INFO L226 Difference]: Without dead ends: 197386 [2019-12-27 05:09:34,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:09:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197386 states. [2019-12-27 05:09:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197386 to 116240. [2019-12-27 05:09:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116240 states. [2019-12-27 05:09:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116240 states to 116240 states and 401260 transitions. [2019-12-27 05:09:42,647 INFO L78 Accepts]: Start accepts. Automaton has 116240 states and 401260 transitions. Word has length 37 [2019-12-27 05:09:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:09:42,647 INFO L462 AbstractCegarLoop]: Abstraction has 116240 states and 401260 transitions. [2019-12-27 05:09:42,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:09:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 116240 states and 401260 transitions. [2019-12-27 05:09:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 05:09:42,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:42,767 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] [2019-12-27 05:09:42,767 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:42,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:42,768 INFO L82 PathProgramCache]: Analyzing trace with hash -335825104, now seen corresponding path program 1 times [2019-12-27 05:09:42,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:42,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851787523] [2019-12-27 05:09:42,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:09:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:09:42,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851787523] [2019-12-27 05:09:42,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:09:42,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:09:42,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850446735] [2019-12-27 05:09:42,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:09:42,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:09:42,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:09:42,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:09:42,835 INFO L87 Difference]: Start difference. First operand 116240 states and 401260 transitions. Second operand 5 states. [2019-12-27 05:09:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:43,141 INFO L93 Difference]: Finished difference Result 67845 states and 226665 transitions. [2019-12-27 05:09:43,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:09:43,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-27 05:09:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:43,257 INFO L225 Difference]: With dead ends: 67845 [2019-12-27 05:09:43,257 INFO L226 Difference]: Without dead ends: 61529 [2019-12-27 05:09:43,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:09:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61529 states. [2019-12-27 05:09:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61529 to 61529. [2019-12-27 05:09:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61529 states. [2019-12-27 05:09:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61529 states to 61529 states and 207171 transitions. [2019-12-27 05:09:45,195 INFO L78 Accepts]: Start accepts. Automaton has 61529 states and 207171 transitions. Word has length 38 [2019-12-27 05:09:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:09:45,195 INFO L462 AbstractCegarLoop]: Abstraction has 61529 states and 207171 transitions. [2019-12-27 05:09:45,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:09:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 61529 states and 207171 transitions. [2019-12-27 05:09:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:09:45,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:45,251 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] [2019-12-27 05:09:45,251 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1018558760, now seen corresponding path program 1 times [2019-12-27 05:09:45,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:45,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608513948] [2019-12-27 05:09:45,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:09:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:09:45,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608513948] [2019-12-27 05:09:45,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:09:45,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:09:45,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012275565] [2019-12-27 05:09:45,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:09:45,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:09:45,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:09:45,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:09:45,324 INFO L87 Difference]: Start difference. First operand 61529 states and 207171 transitions. Second operand 6 states. [2019-12-27 05:09:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:45,436 INFO L93 Difference]: Finished difference Result 11123 states and 31245 transitions. [2019-12-27 05:09:45,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:09:45,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 05:09:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:45,449 INFO L225 Difference]: With dead ends: 11123 [2019-12-27 05:09:45,449 INFO L226 Difference]: Without dead ends: 7910 [2019-12-27 05:09:45,450 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-27 05:09:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7910 states. [2019-12-27 05:09:45,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7910 to 7898. [2019-12-27 05:09:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7898 states. [2019-12-27 05:09:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7898 states to 7898 states and 19980 transitions. [2019-12-27 05:09:45,541 INFO L78 Accepts]: Start accepts. Automaton has 7898 states and 19980 transitions. Word has length 39 [2019-12-27 05:09:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:09:45,541 INFO L462 AbstractCegarLoop]: Abstraction has 7898 states and 19980 transitions. [2019-12-27 05:09:45,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:09:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7898 states and 19980 transitions. [2019-12-27 05:09:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 05:09:45,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:45,548 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] [2019-12-27 05:09:45,549 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:45,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:45,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1807974181, now seen corresponding path program 1 times [2019-12-27 05:09:45,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:45,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992415433] [2019-12-27 05:09:45,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:09:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:09:45,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992415433] [2019-12-27 05:09:45,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:09:45,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:09:45,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664522594] [2019-12-27 05:09:45,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:09:45,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:09:45,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:09:45,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:09:45,611 INFO L87 Difference]: Start difference. First operand 7898 states and 19980 transitions. Second operand 4 states. [2019-12-27 05:09:45,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:45,652 INFO L93 Difference]: Finished difference Result 8860 states and 22175 transitions. [2019-12-27 05:09:45,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:09:45,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-27 05:09:45,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:45,663 INFO L225 Difference]: With dead ends: 8860 [2019-12-27 05:09:45,663 INFO L226 Difference]: Without dead ends: 7620 [2019-12-27 05:09:45,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:09:45,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2019-12-27 05:09:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 7602. [2019-12-27 05:09:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7602 states. [2019-12-27 05:09:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7602 states to 7602 states and 19247 transitions. [2019-12-27 05:09:45,823 INFO L78 Accepts]: Start accepts. Automaton has 7602 states and 19247 transitions. Word has length 50 [2019-12-27 05:09:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:09:45,823 INFO L462 AbstractCegarLoop]: Abstraction has 7602 states and 19247 transitions. [2019-12-27 05:09:45,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:09:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 7602 states and 19247 transitions. [2019-12-27 05:09:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 05:09:45,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:45,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:09:45,836 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1074177589, now seen corresponding path program 2 times [2019-12-27 05:09:45,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:45,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424876183] [2019-12-27 05:09:45,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:09:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:09:45,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424876183] [2019-12-27 05:09:45,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:09:45,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:09:45,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937950896] [2019-12-27 05:09:45,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:09:45,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:09:45,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:09:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:09:45,980 INFO L87 Difference]: Start difference. First operand 7602 states and 19247 transitions. Second operand 7 states. [2019-12-27 05:09:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:46,098 INFO L93 Difference]: Finished difference Result 6421 states and 16557 transitions. [2019-12-27 05:09:46,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:09:46,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 05:09:46,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:46,099 INFO L225 Difference]: With dead ends: 6421 [2019-12-27 05:09:46,099 INFO L226 Difference]: Without dead ends: 508 [2019-12-27 05:09:46,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:09:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-12-27 05:09:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2019-12-27 05:09:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-12-27 05:09:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1119 transitions. [2019-12-27 05:09:46,107 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1119 transitions. Word has length 50 [2019-12-27 05:09:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:09:46,107 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 1119 transitions. [2019-12-27 05:09:46,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:09:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1119 transitions. [2019-12-27 05:09:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:09:46,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:46,109 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, 1, 1, 1] [2019-12-27 05:09:46,109 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:46,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:46,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1499988210, now seen corresponding path program 1 times [2019-12-27 05:09:46,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:46,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106055040] [2019-12-27 05:09:46,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:09:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:09:46,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106055040] [2019-12-27 05:09:46,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:09:46,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:09:46,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549164502] [2019-12-27 05:09:46,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:09:46,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:09:46,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:09:46,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:09:46,200 INFO L87 Difference]: Start difference. First operand 508 states and 1119 transitions. Second operand 8 states. [2019-12-27 05:09:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:46,417 INFO L93 Difference]: Finished difference Result 1039 states and 2246 transitions. [2019-12-27 05:09:46,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:09:46,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 05:09:46,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:46,419 INFO L225 Difference]: With dead ends: 1039 [2019-12-27 05:09:46,419 INFO L226 Difference]: Without dead ends: 764 [2019-12-27 05:09:46,419 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-27 05:09:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-27 05:09:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 608. [2019-12-27 05:09:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-12-27 05:09:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1300 transitions. [2019-12-27 05:09:46,427 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1300 transitions. Word has length 66 [2019-12-27 05:09:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:09:46,427 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 1300 transitions. [2019-12-27 05:09:46,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:09:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1300 transitions. [2019-12-27 05:09:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:09:46,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:46,428 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, 1, 1, 1] [2019-12-27 05:09:46,428 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash 719111176, now seen corresponding path program 2 times [2019-12-27 05:09:46,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:46,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225660584] [2019-12-27 05:09:46,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:09:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:09:46,585 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:09:46,586 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:09:46,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_25) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~z$w_buff1~0_34) (= 0 v_~__unbuffered_p1_EAX~0_15) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t133~0.base_29| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t133~0.base_29|) |v_ULTIMATE.start_main_~#t133~0.offset_21| 0)) |v_#memory_int_31|) (= (store .cse0 |v_ULTIMATE.start_main_~#t133~0.base_29| 1) |v_#valid_72|) (= v_~a~0_11 0) (= v_~z$w_buff0_used~0_132 0) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~z$r_buff1_thd0~0_21) (= v_~z$r_buff0_thd4~0_77 0) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$r_buff0_thd0~0_21 0) (= v_~z$r_buff0_thd2~0_10 0) (= v_~z$r_buff0_thd3~0_54 0) (= 0 v_~z$r_buff1_thd4~0_38) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_17) (= 0 v_~weak$$choice2~0_36) (= v_~x~0_17 0) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t133~0.base_29|) (= 0 v_~z$w_buff1_used~0_70) (= 0 |v_ULTIMATE.start_main_~#t133~0.offset_21|) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t133~0.base_29| 4)) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_13) (= 0 v_~weak$$choice0~0_11) (= v_~z$r_buff1_thd1~0_9 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$r_buff1_thd3~0_27) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_14) (= |v_#NULL.offset_4| 0) (= v_~z$mem_tmp~0_12 0) (= 0 v_~__unbuffered_p3_EAX~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t133~0.base_29|)) (= v_~y~0_11 0) (= 0 v_~z$w_buff0~0_39) (= v_~main$tmp_guard0~0_11 0) (= v_~z~0_29 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_19|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_77, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_13, ULTIMATE.start_main_~#t135~0.base=|v_ULTIMATE.start_main_~#t135~0.base_20|, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ULTIMATE.start_main_~#t134~0.offset=|v_ULTIMATE.start_main_~#t134~0.offset_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_~#t136~0.base=|v_ULTIMATE.start_main_~#t136~0.base_21|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_9, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ULTIMATE.start_main_~#t136~0.offset=|v_ULTIMATE.start_main_~#t136~0.offset_17|, ~x~0=v_~x~0_17, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_38, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ULTIMATE.start_main_~#t135~0.offset=|v_ULTIMATE.start_main_~#t135~0.offset_17|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_21, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ULTIMATE.start_main_~#t133~0.base=|v_ULTIMATE.start_main_~#t133~0.base_29|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t133~0.offset=|v_ULTIMATE.start_main_~#t133~0.offset_21|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_14|, ULTIMATE.start_main_~#t134~0.base=|v_ULTIMATE.start_main_~#t134~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_31|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t135~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t134~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t136~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t136~0.offset, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t135~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t133~0.base, #NULL.base, ULTIMATE.start_main_~#t133~0.offset, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t134~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:09:46,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] L856-1-->L858: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t134~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t134~0.base_11|) |v_ULTIMATE.start_main_~#t134~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t134~0.base_11| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t134~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t134~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t134~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t134~0.base_11|)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t134~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t134~0.base=|v_ULTIMATE.start_main_~#t134~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|, ULTIMATE.start_main_~#t134~0.offset=|v_ULTIMATE.start_main_~#t134~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t134~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t134~0.offset] because there is no mapped edge [2019-12-27 05:09:46,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L858-1-->L860: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t135~0.offset_11|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t135~0.base_12|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t135~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t135~0.base_12|) |v_ULTIMATE.start_main_~#t135~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t135~0.base_12| 0)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t135~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t135~0.base_12| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t135~0.base_12| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t135~0.offset=|v_ULTIMATE.start_main_~#t135~0.offset_11|, ULTIMATE.start_main_~#t135~0.base=|v_ULTIMATE.start_main_~#t135~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t135~0.offset, ULTIMATE.start_main_~#t135~0.base, #length] because there is no mapped edge [2019-12-27 05:09:46,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L860-1-->L862: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t136~0.base_13| 4) |v_#length_23|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t136~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t136~0.base_13|) |v_ULTIMATE.start_main_~#t136~0.offset_11| 3)) |v_#memory_int_23|) (= 0 |v_ULTIMATE.start_main_~#t136~0.offset_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t136~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t136~0.base_13|)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t136~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t136~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t136~0.base=|v_ULTIMATE.start_main_~#t136~0.base_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_~#t136~0.offset=|v_ULTIMATE.start_main_~#t136~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t136~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t136~0.offset] because there is no mapped edge [2019-12-27 05:09:46,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_23 v_~z$w_buff1~0_18) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|) (= v_~z$w_buff0_used~0_91 1) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= 1 v_~z$w_buff0~0_22) (= v_~z$w_buff0_used~0_92 v_~z$w_buff1_used~0_51) (= 0 (mod v_~z$w_buff1_used~0_51 256)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_51, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z$w_buff1~0=v_~z$w_buff1~0_18, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 05:09:46,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1968341095 256) 0)) (.cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out1968341095| |P3Thread1of1ForFork2_#t~ite29_Out1968341095|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1968341095 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out1968341095| ~z$w_buff1~0_In1968341095)) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out1968341095| ~z$w_buff0~0_In1968341095) .cse2 (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1968341095, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1968341095, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1968341095, ~z$w_buff1~0=~z$w_buff1~0_In1968341095} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1968341095|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1968341095|, ~z$w_buff0~0=~z$w_buff0~0_In1968341095, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1968341095, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1968341095, ~z$w_buff1~0=~z$w_buff1~0_In1968341095} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 05:09:46,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~z$r_buff0_thd4~0_51 v_~z$r_buff0_thd4~0_50)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_8|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 05:09:46,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1829611573 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out1829611573| ~z$mem_tmp~0_In1829611573)) (and (= |P3Thread1of1ForFork2_#t~ite48_Out1829611573| ~z~0_In1829611573) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1829611573, ~z$flush_delayed~0=~z$flush_delayed~0_In1829611573, ~z~0=~z~0_In1829611573} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1829611573, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1829611573|, ~z$flush_delayed~0=~z$flush_delayed~0_In1829611573, ~z~0=~z~0_In1829611573} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-27 05:09:46,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1024] [1024] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= 1 v_~a~0_6) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 1 v_~x~0_8)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 05:09:46,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= 2 v_~x~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_5)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_5, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 05:09:46,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1082541415 256)))) (or (and (= ~z$mem_tmp~0_In1082541415 |P2Thread1of1ForFork1_#t~ite25_Out1082541415|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out1082541415| ~z~0_In1082541415)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1082541415, ~z$flush_delayed~0=~z$flush_delayed~0_In1082541415, ~z~0=~z~0_In1082541415} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1082541415, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out1082541415|, ~z$flush_delayed~0=~z$flush_delayed~0_In1082541415, ~z~0=~z~0_In1082541415} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 05:09:46,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1941028998 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1941028998 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out-1941028998| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out-1941028998| ~z$w_buff0_used~0_In-1941028998)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1941028998, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1941028998} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1941028998|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1941028998, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1941028998} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-27 05:09:46,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1014235944 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1014235944 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1014235944 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1014235944 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1014235944|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite52_Out-1014235944| ~z$w_buff1_used~0_In-1014235944)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1014235944, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1014235944, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1014235944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1014235944} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1014235944|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1014235944, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1014235944, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1014235944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1014235944} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-27 05:09:46,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1301182139 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1301182139 256)))) (or (and (= ~z$r_buff0_thd4~0_Out1301182139 ~z$r_buff0_thd4~0_In1301182139) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out1301182139) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1301182139, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1301182139} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1301182139|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1301182139, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1301182139} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 05:09:46,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-1020419519 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1020419519 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1020419519 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1020419519 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-1020419519|)) (and (= ~z$r_buff1_thd4~0_In-1020419519 |P3Thread1of1ForFork2_#t~ite54_Out-1020419519|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1020419519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1020419519, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1020419519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1020419519} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1020419519|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1020419519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1020419519, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1020419519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1020419519} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-27 05:09:46,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_8| v_~z$r_buff1_thd4~0_32) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_7|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_32, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:09:46,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L788-2-->P2EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~z~0_23 |v_P2Thread1of1ForFork1_#t~ite25_8|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_23, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 05:09:46,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~z$r_buff0_thd0~0_14 256)) (= 0 (mod v_~z$w_buff0_used~0_93 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 05:09:46,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1432625424 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1432625424 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out1432625424| |ULTIMATE.start_main_#t~ite60_Out1432625424|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff1~0_In1432625424 |ULTIMATE.start_main_#t~ite59_Out1432625424|)) (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite59_Out1432625424| ~z~0_In1432625424)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1432625424, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1432625424, ~z$w_buff1~0=~z$w_buff1~0_In1432625424, ~z~0=~z~0_In1432625424} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1432625424|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1432625424, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1432625424, ~z$w_buff1~0=~z$w_buff1~0_In1432625424, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1432625424|, ~z~0=~z~0_In1432625424} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 05:09:46,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1961395119 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1961395119 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-1961395119|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1961395119| ~z$w_buff0_used~0_In-1961395119)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1961395119, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1961395119} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1961395119, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1961395119|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1961395119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 05:09:46,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1123310147 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1123310147 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1123310147 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1123310147 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1123310147|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out1123310147| ~z$w_buff1_used~0_In1123310147)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1123310147, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1123310147, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1123310147, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1123310147} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1123310147|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1123310147, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1123310147, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1123310147, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1123310147} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 05:09:46,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-826670180 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-826670180 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-826670180 |ULTIMATE.start_main_#t~ite63_Out-826670180|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out-826670180|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-826670180, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-826670180} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-826670180|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-826670180, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-826670180} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 05:09:46,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In278345682 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In278345682 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In278345682 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In278345682 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out278345682| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In278345682 |ULTIMATE.start_main_#t~ite64_Out278345682|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In278345682, ~z$w_buff0_used~0=~z$w_buff0_used~0_In278345682, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In278345682, ~z$w_buff1_used~0=~z$w_buff1_used~0_In278345682} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In278345682, ~z$w_buff0_used~0=~z$w_buff0_used~0_In278345682, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In278345682, ~z$w_buff1_used~0=~z$w_buff1_used~0_In278345682, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out278345682|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 05:09:46,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1044] [1044] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_7) (= |v_ULTIMATE.start_main_#t~ite64_11| v_~z$r_buff1_thd0~0_15) (= v_~main$tmp_guard1~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_~x~0_11 2)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:09:46,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:09:46 BasicIcfg [2019-12-27 05:09:46,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:09:46,773 INFO L168 Benchmark]: Toolchain (without parser) took 165729.77 ms. Allocated memory was 146.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 05:09:46,774 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 05:09:46,775 INFO L168 Benchmark]: CACSL2BoogieTranslator took 999.03 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 100.2 MB in the beginning and 156.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:09:46,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.87 ms. Allocated memory is still 205.0 MB. Free memory was 156.5 MB in the beginning and 153.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 05:09:46,776 INFO L168 Benchmark]: Boogie Preprocessor took 81.49 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 150.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 05:09:46,776 INFO L168 Benchmark]: RCFGBuilder took 953.57 ms. Allocated memory was 205.0 MB in the beginning and 233.3 MB in the end (delta: 28.3 MB). Free memory was 150.1 MB in the beginning and 202.7 MB in the end (delta: -52.6 MB). Peak memory consumption was 63.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:09:46,777 INFO L168 Benchmark]: TraceAbstraction took 163589.18 ms. Allocated memory was 233.3 MB in the beginning and 4.0 GB in the end (delta: 3.7 GB). Free memory was 202.7 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 05:09:46,780 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 999.03 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 100.2 MB in the beginning and 156.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 101.87 ms. Allocated memory is still 205.0 MB. Free memory was 156.5 MB in the beginning and 153.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.49 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 150.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 953.57 ms. Allocated memory was 205.0 MB in the beginning and 233.3 MB in the end (delta: 28.3 MB). Free memory was 150.1 MB in the beginning and 202.7 MB in the end (delta: -52.6 MB). Peak memory consumption was 63.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 163589.18 ms. Allocated memory was 233.3 MB in the beginning and 4.0 GB in the end (delta: 3.7 GB). Free memory was 202.7 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 212 ProgramPointsBefore, 115 ProgramPointsAfterwards, 255 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 47 ConcurrentYvCompositions, 28 ChoiceCompositions, 10757 VarBasedMoverChecksPositive, 248 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 148368 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 163.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 48.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4717 SDtfs, 7025 SDslu, 9987 SDs, 0 SdLazy, 3846 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149078occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 95.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 265029 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 665 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 580 ConstructedInterpolants, 0 QuantifiedInterpolants, 71108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...