/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/mix015_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:30:26,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:30:26,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:30:26,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:30:26,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:30:26,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:30:26,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:30:26,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:30:26,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:30:26,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:30:26,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:30:26,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:30:26,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:30:26,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:30:26,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:30:26,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:30:26,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:30:26,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:30:26,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:30:26,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:30:26,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:30:26,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:30:26,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:30:26,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:30:26,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:30:26,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:30:26,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:30:26,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:30:26,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:30:26,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:30:26,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:30:26,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:30:26,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:30:26,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:30:26,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:30:26,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:30:26,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:30:26,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:30:26,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:30:26,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:30:26,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:30:26,110 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:30:26,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:30:26,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:30:26,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:30:26,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:30:26,135 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:30:26,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:30:26,135 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:30:26,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:30:26,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:30:26,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:30:26,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:30:26,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:30:26,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:30:26,138 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:30:26,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:30:26,138 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:30:26,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:30:26,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:30:26,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:30:26,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:30:26,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:30:26,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:30:26,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:30:26,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:30:26,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:30:26,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:30:26,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:30:26,140 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:30:26,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:30:26,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:30:26,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:30:26,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:30:26,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:30:26,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:30:26,434 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:30:26,434 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_rmo.opt.i [2019-12-27 05:30:26,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c207a2ca/7c72d9c78d4b4e9ebabd6366093c0515/FLAG285e14109 [2019-12-27 05:30:27,079 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:30:27,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_rmo.opt.i [2019-12-27 05:30:27,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c207a2ca/7c72d9c78d4b4e9ebabd6366093c0515/FLAG285e14109 [2019-12-27 05:30:27,362 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c207a2ca/7c72d9c78d4b4e9ebabd6366093c0515 [2019-12-27 05:30:27,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:30:27,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:30:27,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:30:27,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:30:27,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:30:27,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:30:27" (1/1) ... [2019-12-27 05:30:27,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:30:27, skipping insertion in model container [2019-12-27 05:30:27,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:30:27" (1/1) ... [2019-12-27 05:30:27,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:30:27,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:30:28,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:30:28,036 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:30:28,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:30:28,208 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:30:28,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:30:28 WrapperNode [2019-12-27 05:30:28,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:30:28,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:30:28,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:30:28,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:30:28,221 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:30:28" (1/1) ... [2019-12-27 05:30:28,252 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:30:28" (1/1) ... [2019-12-27 05:30:28,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:30:28,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:30:28,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:30:28,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:30:28,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:30:28" (1/1) ... [2019-12-27 05:30:28,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:30:28" (1/1) ... [2019-12-27 05:30:28,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:30:28" (1/1) ... [2019-12-27 05:30:28,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:30:28" (1/1) ... [2019-12-27 05:30:28,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:30:28" (1/1) ... [2019-12-27 05:30:28,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:30:28" (1/1) ... [2019-12-27 05:30:28,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:30:28" (1/1) ... [2019-12-27 05:30:28,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:30:28,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:30:28,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:30:28,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:30:28,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:30:28" (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:30:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:30:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:30:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:30:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:30:28,446 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:30:28,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:30:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:30:28,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:30:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:30:28,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:30:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:30:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:30:28,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:30:28,452 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:30:29,494 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:30:29,495 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:30:29,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:30:29 BoogieIcfgContainer [2019-12-27 05:30:29,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:30:29,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:30:29,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:30:29,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:30:29,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:30:27" (1/3) ... [2019-12-27 05:30:29,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169512c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:30:29, skipping insertion in model container [2019-12-27 05:30:29,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:30:28" (2/3) ... [2019-12-27 05:30:29,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169512c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:30:29, skipping insertion in model container [2019-12-27 05:30:29,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:30:29" (3/3) ... [2019-12-27 05:30:29,520 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_rmo.opt.i [2019-12-27 05:30:29,531 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:30:29,531 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:30:29,540 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:30:29,541 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:30:29,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,585 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,586 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,589 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,610 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,610 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,610 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,611 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,611 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,638 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,639 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,641 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,648 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,648 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,652 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,655 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:30:29,671 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:30:29,691 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:30:29,691 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:30:29,692 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:30:29,692 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:30:29,692 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:30:29,692 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:30:29,692 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:30:29,692 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:30:29,710 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-27 05:30:29,712 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 05:30:29,833 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 05:30:29,834 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:30:29,854 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 560 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 05:30:29,884 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 05:30:29,949 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 05:30:29,949 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:30:29,961 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 560 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 05:30:29,995 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 05:30:29,997 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:30:33,499 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 05:30:34,032 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 05:30:34,162 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:30:34,207 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123560 [2019-12-27 05:30:34,207 INFO L214 etLargeBlockEncoding]: Total number of compositions: 125 [2019-12-27 05:30:34,211 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 129 transitions [2019-12-27 05:30:37,995 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44490 states. [2019-12-27 05:30:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 44490 states. [2019-12-27 05:30:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 05:30:38,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:38,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:30:38,006 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:30:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1505007742, now seen corresponding path program 1 times [2019-12-27 05:30:38,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:38,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402330508] [2019-12-27 05:30:38,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:38,275 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:30:38,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402330508] [2019-12-27 05:30:38,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:38,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:30:38,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353486447] [2019-12-27 05:30:38,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:30:38,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:38,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:30:38,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:30:38,304 INFO L87 Difference]: Start difference. First operand 44490 states. Second operand 3 states. [2019-12-27 05:30:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:39,449 INFO L93 Difference]: Finished difference Result 43938 states and 178808 transitions. [2019-12-27 05:30:39,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:30:39,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 05:30:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:39,839 INFO L225 Difference]: With dead ends: 43938 [2019-12-27 05:30:39,843 INFO L226 Difference]: Without dead ends: 40902 [2019-12-27 05:30:39,846 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:30:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40902 states. [2019-12-27 05:30:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40902 to 40902. [2019-12-27 05:30:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40902 states. [2019-12-27 05:30:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40902 states to 40902 states and 166338 transitions. [2019-12-27 05:30:43,520 INFO L78 Accepts]: Start accepts. Automaton has 40902 states and 166338 transitions. Word has length 7 [2019-12-27 05:30:43,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:43,521 INFO L462 AbstractCegarLoop]: Abstraction has 40902 states and 166338 transitions. [2019-12-27 05:30:43,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:30:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 40902 states and 166338 transitions. [2019-12-27 05:30:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:30:43,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:43,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:30:43,528 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:30:43,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:43,528 INFO L82 PathProgramCache]: Analyzing trace with hash 677553064, now seen corresponding path program 1 times [2019-12-27 05:30:43,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:43,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49366607] [2019-12-27 05:30:43,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:43,665 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:30:43,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49366607] [2019-12-27 05:30:43,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:43,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:30:43,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805943239] [2019-12-27 05:30:43,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:30:43,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:43,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:30:43,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:30:43,670 INFO L87 Difference]: Start difference. First operand 40902 states and 166338 transitions. Second operand 4 states. [2019-12-27 05:30:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:46,388 INFO L93 Difference]: Finished difference Result 64724 states and 253367 transitions. [2019-12-27 05:30:46,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:30:46,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 05:30:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:46,765 INFO L225 Difference]: With dead ends: 64724 [2019-12-27 05:30:46,765 INFO L226 Difference]: Without dead ends: 64696 [2019-12-27 05:30:46,766 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:30:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64696 states. [2019-12-27 05:30:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64696 to 62026. [2019-12-27 05:30:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62026 states. [2019-12-27 05:30:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62026 states to 62026 states and 244788 transitions. [2019-12-27 05:30:49,478 INFO L78 Accepts]: Start accepts. Automaton has 62026 states and 244788 transitions. Word has length 13 [2019-12-27 05:30:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:49,478 INFO L462 AbstractCegarLoop]: Abstraction has 62026 states and 244788 transitions. [2019-12-27 05:30:49,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:30:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 62026 states and 244788 transitions. [2019-12-27 05:30:49,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:30:49,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:49,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:30:49,488 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:30:49,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:49,488 INFO L82 PathProgramCache]: Analyzing trace with hash 112792732, now seen corresponding path program 1 times [2019-12-27 05:30:49,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:49,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175387998] [2019-12-27 05:30:49,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:49,623 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:30:49,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175387998] [2019-12-27 05:30:49,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:49,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:30:49,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133306563] [2019-12-27 05:30:49,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:30:49,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:30:49,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:30:49,625 INFO L87 Difference]: Start difference. First operand 62026 states and 244788 transitions. Second operand 4 states. [2019-12-27 05:30:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:52,404 INFO L93 Difference]: Finished difference Result 79640 states and 309877 transitions. [2019-12-27 05:30:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:30:52,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:30:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:52,923 INFO L225 Difference]: With dead ends: 79640 [2019-12-27 05:30:52,924 INFO L226 Difference]: Without dead ends: 79612 [2019-12-27 05:30:52,924 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:30:53,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79612 states. [2019-12-27 05:30:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79612 to 70360. [2019-12-27 05:30:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70360 states. [2019-12-27 05:30:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70360 states to 70360 states and 276483 transitions. [2019-12-27 05:30:55,268 INFO L78 Accepts]: Start accepts. Automaton has 70360 states and 276483 transitions. Word has length 16 [2019-12-27 05:30:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:55,268 INFO L462 AbstractCegarLoop]: Abstraction has 70360 states and 276483 transitions. [2019-12-27 05:30:55,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:30:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 70360 states and 276483 transitions. [2019-12-27 05:30:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 05:30:55,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:55,279 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:30:55,280 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:30:55,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:55,280 INFO L82 PathProgramCache]: Analyzing trace with hash -273272720, now seen corresponding path program 1 times [2019-12-27 05:30:55,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:55,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893734082] [2019-12-27 05:30:55,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:55,382 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:30:55,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893734082] [2019-12-27 05:30:55,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:55,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:30:55,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156671074] [2019-12-27 05:30:55,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:30:55,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:55,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:30:55,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:30:55,385 INFO L87 Difference]: Start difference. First operand 70360 states and 276483 transitions. Second operand 3 states. [2019-12-27 05:30:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:56,292 INFO L93 Difference]: Finished difference Result 67400 states and 263329 transitions. [2019-12-27 05:30:56,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:30:56,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 05:30:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:56,466 INFO L225 Difference]: With dead ends: 67400 [2019-12-27 05:30:56,466 INFO L226 Difference]: Without dead ends: 67400 [2019-12-27 05:30:56,466 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:30:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67400 states. [2019-12-27 05:31:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67400 to 67400. [2019-12-27 05:31:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67400 states. [2019-12-27 05:31:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67400 states to 67400 states and 263329 transitions. [2019-12-27 05:31:01,270 INFO L78 Accepts]: Start accepts. Automaton has 67400 states and 263329 transitions. Word has length 18 [2019-12-27 05:31:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:01,270 INFO L462 AbstractCegarLoop]: Abstraction has 67400 states and 263329 transitions. [2019-12-27 05:31:01,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:31:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 67400 states and 263329 transitions. [2019-12-27 05:31:01,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 05:31:01,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:01,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:01,282 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:01,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:01,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1926185113, now seen corresponding path program 1 times [2019-12-27 05:31:01,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:01,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800556422] [2019-12-27 05:31:01,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:01,376 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:31:01,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800556422] [2019-12-27 05:31:01,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:01,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:31:01,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477042131] [2019-12-27 05:31:01,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:31:01,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:01,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:31:01,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:31:01,378 INFO L87 Difference]: Start difference. First operand 67400 states and 263329 transitions. Second operand 3 states. [2019-12-27 05:31:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:01,648 INFO L93 Difference]: Finished difference Result 65194 states and 255571 transitions. [2019-12-27 05:31:01,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:31:01,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 05:31:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:01,805 INFO L225 Difference]: With dead ends: 65194 [2019-12-27 05:31:01,805 INFO L226 Difference]: Without dead ends: 65026 [2019-12-27 05:31:01,805 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:31:03,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65026 states. [2019-12-27 05:31:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65026 to 65026. [2019-12-27 05:31:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65026 states. [2019-12-27 05:31:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65026 states to 65026 states and 254975 transitions. [2019-12-27 05:31:04,550 INFO L78 Accepts]: Start accepts. Automaton has 65026 states and 254975 transitions. Word has length 19 [2019-12-27 05:31:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:04,550 INFO L462 AbstractCegarLoop]: Abstraction has 65026 states and 254975 transitions. [2019-12-27 05:31:04,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:31:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 65026 states and 254975 transitions. [2019-12-27 05:31:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:31:04,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:04,572 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:31:04,572 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1957122366, now seen corresponding path program 1 times [2019-12-27 05:31:04,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:04,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933050568] [2019-12-27 05:31:04,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:04,671 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:31:04,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933050568] [2019-12-27 05:31:04,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:04,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:04,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345638492] [2019-12-27 05:31:04,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:31:04,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:04,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:31:04,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:31:04,673 INFO L87 Difference]: Start difference. First operand 65026 states and 254975 transitions. Second operand 5 states. [2019-12-27 05:31:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:07,855 INFO L93 Difference]: Finished difference Result 77638 states and 300400 transitions. [2019-12-27 05:31:07,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:31:07,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:31:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:08,050 INFO L225 Difference]: With dead ends: 77638 [2019-12-27 05:31:08,051 INFO L226 Difference]: Without dead ends: 77586 [2019-12-27 05:31:08,051 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:31:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77586 states. [2019-12-27 05:31:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77586 to 64714. [2019-12-27 05:31:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64714 states. [2019-12-27 05:31:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64714 states to 64714 states and 253901 transitions. [2019-12-27 05:31:09,965 INFO L78 Accepts]: Start accepts. Automaton has 64714 states and 253901 transitions. Word has length 22 [2019-12-27 05:31:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:09,966 INFO L462 AbstractCegarLoop]: Abstraction has 64714 states and 253901 transitions. [2019-12-27 05:31:09,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:31:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 64714 states and 253901 transitions. [2019-12-27 05:31:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:31:10,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:10,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:10,047 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1591094238, now seen corresponding path program 1 times [2019-12-27 05:31:10,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:10,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319238373] [2019-12-27 05:31:10,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:10,133 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:31:10,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319238373] [2019-12-27 05:31:10,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:10,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:10,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474082940] [2019-12-27 05:31:10,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:31:10,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:10,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:31:10,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:31:10,136 INFO L87 Difference]: Start difference. First operand 64714 states and 253901 transitions. Second operand 5 states. [2019-12-27 05:31:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:11,201 INFO L93 Difference]: Finished difference Result 98650 states and 392447 transitions. [2019-12-27 05:31:11,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:31:11,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 05:31:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:11,437 INFO L225 Difference]: With dead ends: 98650 [2019-12-27 05:31:11,437 INFO L226 Difference]: Without dead ends: 86402 [2019-12-27 05:31:11,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:31:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86402 states. [2019-12-27 05:31:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86402 to 86402. [2019-12-27 05:31:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86402 states. [2019-12-27 05:31:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86402 states to 86402 states and 344757 transitions. [2019-12-27 05:31:16,878 INFO L78 Accepts]: Start accepts. Automaton has 86402 states and 344757 transitions. Word has length 33 [2019-12-27 05:31:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:16,878 INFO L462 AbstractCegarLoop]: Abstraction has 86402 states and 344757 transitions. [2019-12-27 05:31:16,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:31:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 86402 states and 344757 transitions. [2019-12-27 05:31:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:31:17,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:17,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:17,013 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1515214664, now seen corresponding path program 2 times [2019-12-27 05:31:17,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:17,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365509974] [2019-12-27 05:31:17,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:17,081 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:31:17,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365509974] [2019-12-27 05:31:17,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:17,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:31:17,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224865873] [2019-12-27 05:31:17,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:31:17,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:17,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:31:17,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:31:17,084 INFO L87 Difference]: Start difference. First operand 86402 states and 344757 transitions. Second operand 3 states. [2019-12-27 05:31:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:17,503 INFO L93 Difference]: Finished difference Result 86402 states and 339859 transitions. [2019-12-27 05:31:17,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:31:17,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 05:31:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:17,719 INFO L225 Difference]: With dead ends: 86402 [2019-12-27 05:31:17,719 INFO L226 Difference]: Without dead ends: 86402 [2019-12-27 05:31:17,719 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:31:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86402 states. [2019-12-27 05:31:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86402 to 86082. [2019-12-27 05:31:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86082 states. [2019-12-27 05:31:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86082 states to 86082 states and 338771 transitions. [2019-12-27 05:31:23,727 INFO L78 Accepts]: Start accepts. Automaton has 86082 states and 338771 transitions. Word has length 33 [2019-12-27 05:31:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:23,727 INFO L462 AbstractCegarLoop]: Abstraction has 86082 states and 338771 transitions. [2019-12-27 05:31:23,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:31:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 86082 states and 338771 transitions. [2019-12-27 05:31:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:31:23,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:23,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:23,852 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:23,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:23,853 INFO L82 PathProgramCache]: Analyzing trace with hash 302839362, now seen corresponding path program 1 times [2019-12-27 05:31:23,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:23,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663280506] [2019-12-27 05:31:23,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:23,972 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:31:23,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663280506] [2019-12-27 05:31:23,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:23,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:31:23,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274139544] [2019-12-27 05:31:23,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:31:23,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:23,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:31:23,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:31:23,975 INFO L87 Difference]: Start difference. First operand 86082 states and 338771 transitions. Second operand 7 states. [2019-12-27 05:31:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:24,872 INFO L93 Difference]: Finished difference Result 138233 states and 539955 transitions. [2019-12-27 05:31:24,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:31:24,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 05:31:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:25,201 INFO L225 Difference]: With dead ends: 138233 [2019-12-27 05:31:25,201 INFO L226 Difference]: Without dead ends: 127499 [2019-12-27 05:31:25,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:31:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127499 states. [2019-12-27 05:31:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127499 to 97338. [2019-12-27 05:31:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97338 states. [2019-12-27 05:31:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97338 states to 97338 states and 383109 transitions. [2019-12-27 05:31:33,688 INFO L78 Accepts]: Start accepts. Automaton has 97338 states and 383109 transitions. Word has length 34 [2019-12-27 05:31:33,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:33,688 INFO L462 AbstractCegarLoop]: Abstraction has 97338 states and 383109 transitions. [2019-12-27 05:31:33,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:31:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand 97338 states and 383109 transitions. [2019-12-27 05:31:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:31:33,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:33,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:33,808 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:33,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1501247722, now seen corresponding path program 2 times [2019-12-27 05:31:33,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:33,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525604024] [2019-12-27 05:31:33,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:33,933 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:31:33,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525604024] [2019-12-27 05:31:33,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:33,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:31:33,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306929571] [2019-12-27 05:31:33,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:31:33,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:33,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:31:33,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:31:33,935 INFO L87 Difference]: Start difference. First operand 97338 states and 383109 transitions. Second operand 8 states. [2019-12-27 05:31:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:35,135 INFO L93 Difference]: Finished difference Result 161825 states and 629967 transitions. [2019-12-27 05:31:35,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 05:31:35,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 05:31:35,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:36,428 INFO L225 Difference]: With dead ends: 161825 [2019-12-27 05:31:36,428 INFO L226 Difference]: Without dead ends: 147083 [2019-12-27 05:31:36,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:31:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147083 states. [2019-12-27 05:31:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147083 to 107928. [2019-12-27 05:31:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107928 states. [2019-12-27 05:31:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107928 states to 107928 states and 423144 transitions. [2019-12-27 05:31:40,032 INFO L78 Accepts]: Start accepts. Automaton has 107928 states and 423144 transitions. Word has length 34 [2019-12-27 05:31:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:40,033 INFO L462 AbstractCegarLoop]: Abstraction has 107928 states and 423144 transitions. [2019-12-27 05:31:40,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:31:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 107928 states and 423144 transitions. [2019-12-27 05:31:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:31:40,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:40,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:40,171 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1498221088, now seen corresponding path program 3 times [2019-12-27 05:31:40,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:40,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035829959] [2019-12-27 05:31:40,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:40,311 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:31:40,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035829959] [2019-12-27 05:31:40,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:40,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:31:40,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074067385] [2019-12-27 05:31:40,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:31:40,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:40,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:31:40,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:31:40,313 INFO L87 Difference]: Start difference. First operand 107928 states and 423144 transitions. Second operand 9 states. [2019-12-27 05:31:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:43,255 INFO L93 Difference]: Finished difference Result 195515 states and 772098 transitions. [2019-12-27 05:31:43,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 05:31:43,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 05:31:43,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:43,806 INFO L225 Difference]: With dead ends: 195515 [2019-12-27 05:31:43,807 INFO L226 Difference]: Without dead ends: 187267 [2019-12-27 05:31:43,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:31:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187267 states. [2019-12-27 05:31:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187267 to 107754. [2019-12-27 05:31:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107754 states. [2019-12-27 05:31:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107754 states to 107754 states and 422483 transitions. [2019-12-27 05:31:54,560 INFO L78 Accepts]: Start accepts. Automaton has 107754 states and 422483 transitions. Word has length 34 [2019-12-27 05:31:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:54,560 INFO L462 AbstractCegarLoop]: Abstraction has 107754 states and 422483 transitions. [2019-12-27 05:31:54,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:31:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 107754 states and 422483 transitions. [2019-12-27 05:31:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:31:54,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:54,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:54,696 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:54,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:54,697 INFO L82 PathProgramCache]: Analyzing trace with hash 652066138, now seen corresponding path program 4 times [2019-12-27 05:31:54,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:54,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16778012] [2019-12-27 05:31:54,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:54,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:31:54,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16778012] [2019-12-27 05:31:54,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:54,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:31:54,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109835925] [2019-12-27 05:31:54,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:31:54,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:54,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:31:54,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:31:54,763 INFO L87 Difference]: Start difference. First operand 107754 states and 422483 transitions. Second operand 5 states. [2019-12-27 05:31:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:54,865 INFO L93 Difference]: Finished difference Result 13507 states and 45971 transitions. [2019-12-27 05:31:54,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:31:54,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 05:31:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:54,882 INFO L225 Difference]: With dead ends: 13507 [2019-12-27 05:31:54,883 INFO L226 Difference]: Without dead ends: 7547 [2019-12-27 05:31:54,883 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:31:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7547 states. [2019-12-27 05:31:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7547 to 7547. [2019-12-27 05:31:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7547 states. [2019-12-27 05:31:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7547 states to 7547 states and 21921 transitions. [2019-12-27 05:31:54,979 INFO L78 Accepts]: Start accepts. Automaton has 7547 states and 21921 transitions. Word has length 34 [2019-12-27 05:31:54,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:54,979 INFO L462 AbstractCegarLoop]: Abstraction has 7547 states and 21921 transitions. [2019-12-27 05:31:54,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:31:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 7547 states and 21921 transitions. [2019-12-27 05:31:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 05:31:54,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:54,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:54,987 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:54,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:54,988 INFO L82 PathProgramCache]: Analyzing trace with hash -386106907, now seen corresponding path program 1 times [2019-12-27 05:31:54,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:54,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914367169] [2019-12-27 05:31:54,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:55,052 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:31:55,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914367169] [2019-12-27 05:31:55,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:55,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:55,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602706348] [2019-12-27 05:31:55,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:31:55,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:55,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:31:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:31:55,054 INFO L87 Difference]: Start difference. First operand 7547 states and 21921 transitions. Second operand 4 states. [2019-12-27 05:31:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:55,099 INFO L93 Difference]: Finished difference Result 8551 states and 24189 transitions. [2019-12-27 05:31:55,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:31:55,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-27 05:31:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:55,113 INFO L225 Difference]: With dead ends: 8551 [2019-12-27 05:31:55,113 INFO L226 Difference]: Without dead ends: 7558 [2019-12-27 05:31:55,115 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:31:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2019-12-27 05:31:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7542. [2019-12-27 05:31:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7542 states. [2019-12-27 05:31:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7542 states to 7542 states and 21841 transitions. [2019-12-27 05:31:55,237 INFO L78 Accepts]: Start accepts. Automaton has 7542 states and 21841 transitions. Word has length 46 [2019-12-27 05:31:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:55,238 INFO L462 AbstractCegarLoop]: Abstraction has 7542 states and 21841 transitions. [2019-12-27 05:31:55,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:31:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 7542 states and 21841 transitions. [2019-12-27 05:31:55,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 05:31:55,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:55,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:55,246 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:55,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:55,247 INFO L82 PathProgramCache]: Analyzing trace with hash 866700389, now seen corresponding path program 2 times [2019-12-27 05:31:55,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:55,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873147000] [2019-12-27 05:31:55,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:55,373 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:31:55,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873147000] [2019-12-27 05:31:55,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:55,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:31:55,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984570446] [2019-12-27 05:31:55,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:31:55,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:55,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:31:55,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:31:55,375 INFO L87 Difference]: Start difference. First operand 7542 states and 21841 transitions. Second operand 6 states. [2019-12-27 05:31:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:55,467 INFO L93 Difference]: Finished difference Result 6230 states and 18826 transitions. [2019-12-27 05:31:55,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:31:55,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-27 05:31:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:55,474 INFO L225 Difference]: With dead ends: 6230 [2019-12-27 05:31:55,474 INFO L226 Difference]: Without dead ends: 3457 [2019-12-27 05:31:55,475 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:31:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2019-12-27 05:31:55,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3433. [2019-12-27 05:31:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3433 states. [2019-12-27 05:31:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 9110 transitions. [2019-12-27 05:31:55,516 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 9110 transitions. Word has length 46 [2019-12-27 05:31:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:55,516 INFO L462 AbstractCegarLoop]: Abstraction has 3433 states and 9110 transitions. [2019-12-27 05:31:55,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:31:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 9110 transitions. [2019-12-27 05:31:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 05:31:55,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:55,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:55,521 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:55,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash -755973282, now seen corresponding path program 1 times [2019-12-27 05:31:55,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:55,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527123891] [2019-12-27 05:31:55,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:55,612 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:31:55,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527123891] [2019-12-27 05:31:55,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:55,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:31:55,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590714322] [2019-12-27 05:31:55,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:31:55,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:55,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:31:55,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:31:55,614 INFO L87 Difference]: Start difference. First operand 3433 states and 9110 transitions. Second operand 7 states. [2019-12-27 05:31:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:55,898 INFO L93 Difference]: Finished difference Result 7642 states and 20306 transitions. [2019-12-27 05:31:55,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:31:55,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-27 05:31:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:55,908 INFO L225 Difference]: With dead ends: 7642 [2019-12-27 05:31:55,908 INFO L226 Difference]: Without dead ends: 6708 [2019-12-27 05:31:55,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:31:55,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2019-12-27 05:31:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 4666. [2019-12-27 05:31:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 05:31:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 12498 transitions. [2019-12-27 05:31:56,391 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 12498 transitions. Word has length 62 [2019-12-27 05:31:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:56,392 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 12498 transitions. [2019-12-27 05:31:56,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:31:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 12498 transitions. [2019-12-27 05:31:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 05:31:56,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:56,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:56,397 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:56,397 INFO L82 PathProgramCache]: Analyzing trace with hash -708400558, now seen corresponding path program 2 times [2019-12-27 05:31:56,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:56,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216616896] [2019-12-27 05:31:56,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:56,470 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:31:56,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216616896] [2019-12-27 05:31:56,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:56,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:56,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86206157] [2019-12-27 05:31:56,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:31:56,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:56,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:31:56,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:31:56,472 INFO L87 Difference]: Start difference. First operand 4666 states and 12498 transitions. Second operand 4 states. [2019-12-27 05:31:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:56,503 INFO L93 Difference]: Finished difference Result 5067 states and 13397 transitions. [2019-12-27 05:31:56,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:31:56,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-27 05:31:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:56,505 INFO L225 Difference]: With dead ends: 5067 [2019-12-27 05:31:56,505 INFO L226 Difference]: Without dead ends: 492 [2019-12-27 05:31:56,506 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:31:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-12-27 05:31:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2019-12-27 05:31:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-12-27 05:31:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1040 transitions. [2019-12-27 05:31:56,513 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1040 transitions. Word has length 62 [2019-12-27 05:31:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:56,513 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 1040 transitions. [2019-12-27 05:31:56,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:31:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1040 transitions. [2019-12-27 05:31:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 05:31:56,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:56,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:56,514 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:56,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:56,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1163616194, now seen corresponding path program 1 times [2019-12-27 05:31:56,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:56,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70771671] [2019-12-27 05:31:56,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:56,604 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:31:56,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70771671] [2019-12-27 05:31:56,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:56,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:31:56,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102361676] [2019-12-27 05:31:56,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:31:56,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:31:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:31:56,606 INFO L87 Difference]: Start difference. First operand 492 states and 1040 transitions. Second operand 8 states. [2019-12-27 05:31:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:56,842 INFO L93 Difference]: Finished difference Result 923 states and 1941 transitions. [2019-12-27 05:31:56,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:31:56,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 05:31:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:56,844 INFO L225 Difference]: With dead ends: 923 [2019-12-27 05:31:56,844 INFO L226 Difference]: Without dead ends: 680 [2019-12-27 05:31:56,845 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:31:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-12-27 05:31:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 516. [2019-12-27 05:31:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-12-27 05:31:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1085 transitions. [2019-12-27 05:31:56,855 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1085 transitions. Word has length 63 [2019-12-27 05:31:56,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:56,855 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 1085 transitions. [2019-12-27 05:31:56,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:31:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1085 transitions. [2019-12-27 05:31:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 05:31:56,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:56,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:56,857 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2097284666, now seen corresponding path program 2 times [2019-12-27 05:31:56,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:56,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710073449] [2019-12-27 05:31:56,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:31:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:31:56,978 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:31:56,978 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:31:56,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= 0 v_~a~0_9) (= 0 v_~z$r_buff1_thd3~0_40) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~z$r_buff1_thd1~0_8 0) (= v_~z$w_buff0_used~0_132 0) (= |v_ULTIMATE.start_main_~#t400~0.offset_20| 0) (= 0 v_~x~0_9) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_34) (= v_~z$r_buff0_thd3~0_75 0) (= 0 v_~z$w_buff0~0_37) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t400~0.base_26| 4)) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_17) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t400~0.base_26| 1)) (= 0 v_~z$w_buff1_used~0_72) (= v_~__unbuffered_p2_EBX~0_13 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd1~0_9 0) (= 0 v_~z$w_buff1~0_31) (= |v_#NULL.offset_5| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t400~0.base_26|)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t400~0.base_26|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t400~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t400~0.base_26|) |v_ULTIMATE.start_main_~#t400~0.offset_20| 0))) (= v_~z$mem_tmp~0_12 0) (= v_~z~0_30 0) (= v_~y~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~z$r_buff0_thd2~0_55 0) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd2~0_31) (= v_~__unbuffered_p0_EBX~0_15 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t402~0.offset=|v_ULTIMATE.start_main_~#t402~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_25|, ULTIMATE.start_main_~#t402~0.base=|v_ULTIMATE.start_main_~#t402~0.base_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_15, ULTIMATE.start_main_~#t400~0.offset=|v_ULTIMATE.start_main_~#t400~0.offset_20|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_23|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_75, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t400~0.base=|v_ULTIMATE.start_main_~#t400~0.base_26|, ULTIMATE.start_main_~#t401~0.offset=|v_ULTIMATE.start_main_~#t401~0.offset_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_55, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_37, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_30, ULTIMATE.start_main_~#t401~0.base=|v_ULTIMATE.start_main_~#t401~0.base_21|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t402~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t402~0.base, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t400~0.offset, ULTIMATE.start_main_#t~ite58, ~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, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t400~0.base, ULTIMATE.start_main_~#t401~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, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t401~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:31:56,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L840-1-->L842: Formula: (and (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t401~0.base_11|)) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t401~0.base_11| 1) |v_#valid_34|) (not (= 0 |v_ULTIMATE.start_main_~#t401~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t401~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t401~0.base_11|) (= |v_ULTIMATE.start_main_~#t401~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t401~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t401~0.base_11|) |v_ULTIMATE.start_main_~#t401~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t401~0.offset=|v_ULTIMATE.start_main_~#t401~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t401~0.base=|v_ULTIMATE.start_main_~#t401~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t401~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t401~0.base] because there is no mapped edge [2019-12-27 05:31:56,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L842-1-->L844: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t402~0.base_11| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t402~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t402~0.base_11|) |v_ULTIMATE.start_main_~#t402~0.offset_10| 2))) (= |v_ULTIMATE.start_main_~#t402~0.offset_10| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t402~0.base_11| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t402~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t402~0.base_11|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t402~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t402~0.offset=|v_ULTIMATE.start_main_~#t402~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t402~0.base=|v_ULTIMATE.start_main_~#t402~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t402~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t402~0.base, #length] because there is no mapped edge [2019-12-27 05:31:56,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] P2ENTRY-->L4-3: Formula: (and (= (mod v_~z$w_buff1_used~0_58 256) 0) (= 1 v_~z$w_buff0~0_24) (= v_~z$w_buff0_used~0_104 v_~z$w_buff1_used~0_58) (= v_~z$w_buff0_used~0_103 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= v_~z$w_buff0~0_25 v_~z$w_buff1~0_22) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_25, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_24, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, ~z$w_buff1~0=v_~z$w_buff1~0_22, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 05:31:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In548696112 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In548696112 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out548696112| ~z$w_buff0~0_In548696112) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff1~0_In548696112 |P2Thread1of1ForFork0_#t~ite28_Out548696112|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In548696112, ~z$w_buff0_used~0=~z$w_buff0_used~0_In548696112, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In548696112, ~z$w_buff1~0=~z$w_buff1~0_In548696112} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out548696112|, ~z$w_buff0~0=~z$w_buff0~0_In548696112, ~z$w_buff0_used~0=~z$w_buff0_used~0_In548696112, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In548696112, ~z$w_buff1~0=~z$w_buff1~0_In548696112} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 05:31:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L802-4-->L803: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, ~z~0=v_~z~0_18, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 05:31:56,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_46 v_~z$r_buff0_thd3~0_45) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:31:56,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1112561571 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-1112561571| ~z$mem_tmp~0_In-1112561571)) (and (= ~z~0_In-1112561571 |P2Thread1of1ForFork0_#t~ite48_Out-1112561571|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1112561571, ~z$flush_delayed~0=~z$flush_delayed~0_In-1112561571, ~z~0=~z~0_In-1112561571} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1112561571|, ~z$mem_tmp~0=~z$mem_tmp~0_In-1112561571, ~z$flush_delayed~0=~z$flush_delayed~0_In-1112561571, ~z~0=~z~0_In-1112561571} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 05:31:57,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 1 v_~x~0_5) (= 1 v_~a~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_6 v_~y~0_6) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~y~0=v_~y~0_6} OutVars{~a~0=v_~a~0_5, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~y~0=v_~y~0_6, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 05:31:57,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-2065194390 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2065194390 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-2065194390|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-2065194390 |P2Thread1of1ForFork0_#t~ite51_Out-2065194390|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2065194390, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2065194390} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2065194390, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2065194390, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-2065194390|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 05:31:57,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1711588544 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1711588544 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1711588544 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1711588544 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out1711588544| ~z$w_buff1_used~0_In1711588544)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out1711588544| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1711588544, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1711588544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1711588544, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1711588544} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1711588544, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1711588544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1711588544, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1711588544|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1711588544} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 05:31:57,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L820-->L821: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1472608315 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1472608315 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd3~0_Out-1472608315) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-1472608315 ~z$r_buff0_thd3~0_Out-1472608315) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1472608315, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1472608315} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1472608315, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1472608315, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1472608315|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 05:31:57,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-271883976 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-271883976 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-271883976 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-271883976 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-271883976 |P2Thread1of1ForFork0_#t~ite54_Out-271883976|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-271883976|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-271883976, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-271883976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-271883976, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-271883976} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-271883976, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-271883976|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-271883976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-271883976, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-271883976} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 05:31:57,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_35 |v_P2Thread1of1ForFork0_#t~ite54_8|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_35, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:31:57,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-908799705 256)))) (or (and (= ~z~0_In-908799705 |P1Thread1of1ForFork2_#t~ite25_Out-908799705|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-908799705 |P1Thread1of1ForFork2_#t~ite25_Out-908799705|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-908799705, ~z$flush_delayed~0=~z$flush_delayed~0_In-908799705, ~z~0=~z~0_In-908799705} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-908799705, ~z$flush_delayed~0=~z$flush_delayed~0_In-908799705, ~z~0=~z~0_In-908799705, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-908799705|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 05:31:57,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L773-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~z~0_25) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_25, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 05:31:57,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] L848-->L850-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~z$w_buff0_used~0_91 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 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_91, ~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_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 05:31:57,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L850-2-->L850-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In599746084 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In599746084 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out599746084| |ULTIMATE.start_main_#t~ite58_Out599746084|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out599746084| ~z$w_buff1~0_In599746084) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite58_Out599746084| ~z~0_In599746084) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In599746084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In599746084, ~z$w_buff1~0=~z$w_buff1~0_In599746084, ~z~0=~z~0_In599746084} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In599746084, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out599746084|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In599746084, ~z$w_buff1~0=~z$w_buff1~0_In599746084, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out599746084|, ~z~0=~z~0_In599746084} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 05:31:57,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-860314510 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-860314510 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-860314510 |ULTIMATE.start_main_#t~ite60_Out-860314510|)) (and (= |ULTIMATE.start_main_#t~ite60_Out-860314510| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-860314510, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-860314510} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-860314510|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-860314510, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-860314510} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 05:31:57,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1772270593 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1772270593 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1772270593 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1772270593 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite61_Out-1772270593| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1772270593| ~z$w_buff1_used~0_In-1772270593) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1772270593, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1772270593, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1772270593, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1772270593} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1772270593, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1772270593|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1772270593, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1772270593, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1772270593} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 05:31:57,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-134901419 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-134901419 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-134901419 |ULTIMATE.start_main_#t~ite62_Out-134901419|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out-134901419| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-134901419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-134901419} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-134901419|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-134901419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-134901419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 05:31:57,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-141236446 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-141236446 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-141236446 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-141236446 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-141236446|)) (and (= |ULTIMATE.start_main_#t~ite63_Out-141236446| ~z$r_buff1_thd0~0_In-141236446) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-141236446, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-141236446, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-141236446, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-141236446} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-141236446|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-141236446, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-141236446, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-141236446, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-141236446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 05:31:57,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~__unbuffered_p0_EBX~0_10 0) (= v_~main$tmp_guard1~0_10 0) (= 1 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite63_13| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EBX~0_8 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_13|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:31:57,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:31:57 BasicIcfg [2019-12-27 05:31:57,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:31:57,174 INFO L168 Benchmark]: Toolchain (without parser) took 89795.07 ms. Allocated memory was 145.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 102.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 05:31:57,175 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 05:31:57,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.45 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 153.7 MB in the end (delta: -51.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:57,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.82 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 150.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:57,178 INFO L168 Benchmark]: Boogie Preprocessor took 65.98 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 147.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:57,179 INFO L168 Benchmark]: RCFGBuilder took 1139.33 ms. Allocated memory is still 202.9 MB. Free memory was 147.5 MB in the beginning and 91.8 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:57,180 INFO L168 Benchmark]: TraceAbstraction took 87669.23 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 91.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 05:31:57,189 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.45 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 153.7 MB in the end (delta: -51.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.82 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 150.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.98 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 147.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1139.33 ms. Allocated memory is still 202.9 MB. Free memory was 147.5 MB in the beginning and 91.8 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87669.23 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 91.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 129 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 9061 VarBasedMoverChecksPositive, 246 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 123560 CheckedPairsTotal, 125 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t400, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L842] FCALL, FORK 0 pthread_create(&t401, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L844] FCALL, FORK 0 pthread_create(&t402, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L802] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L803] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L803] 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)) [L804] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L804] 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)) [L805] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L805] 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)) [L806] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L806] 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)) [L808] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L808] 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)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L758] 2 y = 1 [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=8, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=8, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=8, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=8, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L850] 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) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 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 [L853] 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 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 87.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4044 SDtfs, 5367 SDslu, 9371 SDs, 0 SdLazy, 2534 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107928occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 53.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 176189 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 639 NumberOfCodeBlocks, 639 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 72274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...