/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 01:56:10,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 01:56:10,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 01:56:10,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 01:56:10,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 01:56:10,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 01:56:10,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 01:56:10,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 01:56:10,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 01:56:10,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 01:56:10,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 01:56:10,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 01:56:10,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 01:56:10,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 01:56:10,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 01:56:10,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 01:56:10,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 01:56:10,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 01:56:10,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 01:56:10,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 01:56:10,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 01:56:10,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 01:56:10,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 01:56:10,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 01:56:10,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 01:56:10,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 01:56:10,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 01:56:10,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 01:56:10,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 01:56:10,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 01:56:10,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 01:56:10,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 01:56:10,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 01:56:10,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 01:56:10,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 01:56:10,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 01:56:10,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 01:56:10,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 01:56:10,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 01:56:10,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 01:56:10,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 01:56:10,140 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-NoLbe-MCR.epf [2019-12-28 01:56:10,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 01:56:10,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 01:56:10,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 01:56:10,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 01:56:10,159 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 01:56:10,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 01:56:10,159 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 01:56:10,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 01:56:10,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 01:56:10,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 01:56:10,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 01:56:10,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 01:56:10,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 01:56:10,162 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 01:56:10,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 01:56:10,162 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 01:56:10,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 01:56:10,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 01:56:10,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 01:56:10,164 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 01:56:10,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 01:56:10,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 01:56:10,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 01:56:10,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 01:56:10,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 01:56:10,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 01:56:10,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 01:56:10,166 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 01:56:10,166 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 01:56:10,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 01:56:10,166 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 01:56:10,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 01:56:10,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 01:56:10,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 01:56:10,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 01:56:10,474 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 01:56:10,474 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 01:56:10,475 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.opt.i [2019-12-28 01:56:10,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73d9d7b57/60ac400b8d2544f6b51e4d590e4f620e/FLAGae1db9e41 [2019-12-28 01:56:11,123 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 01:56:11,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_pso.opt.i [2019-12-28 01:56:11,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73d9d7b57/60ac400b8d2544f6b51e4d590e4f620e/FLAGae1db9e41 [2019-12-28 01:56:11,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73d9d7b57/60ac400b8d2544f6b51e4d590e4f620e [2019-12-28 01:56:11,447 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 01:56:11,449 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 01:56:11,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 01:56:11,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 01:56:11,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 01:56:11,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:56:11" (1/1) ... [2019-12-28 01:56:11,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1511a0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:11, skipping insertion in model container [2019-12-28 01:56:11,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:56:11" (1/1) ... [2019-12-28 01:56:11,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 01:56:11,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 01:56:12,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:56:12,116 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 01:56:12,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:56:12,276 INFO L208 MainTranslator]: Completed translation [2019-12-28 01:56:12,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12 WrapperNode [2019-12-28 01:56:12,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 01:56:12,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 01:56:12,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 01:56:12,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 01:56:12,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12" (1/1) ... [2019-12-28 01:56:12,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12" (1/1) ... [2019-12-28 01:56:12,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 01:56:12,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 01:56:12,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 01:56:12,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 01:56:12,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12" (1/1) ... [2019-12-28 01:56:12,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12" (1/1) ... [2019-12-28 01:56:12,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12" (1/1) ... [2019-12-28 01:56:12,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12" (1/1) ... [2019-12-28 01:56:12,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12" (1/1) ... [2019-12-28 01:56:12,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12" (1/1) ... [2019-12-28 01:56:12,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12" (1/1) ... [2019-12-28 01:56:12,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 01:56:12,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 01:56:12,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 01:56:12,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 01:56:12,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12" (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-28 01:56:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 01:56:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 01:56:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 01:56:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 01:56:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 01:56:12,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 01:56:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 01:56:12,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 01:56:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-28 01:56:12,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-28 01:56:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 01:56:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 01:56:12,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 01:56:12,475 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 01:56:13,241 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 01:56:13,242 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 01:56:13,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:56:13 BoogieIcfgContainer [2019-12-28 01:56:13,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 01:56:13,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 01:56:13,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 01:56:13,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 01:56:13,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:56:11" (1/3) ... [2019-12-28 01:56:13,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30431b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:56:13, skipping insertion in model container [2019-12-28 01:56:13,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:56:12" (2/3) ... [2019-12-28 01:56:13,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30431b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:56:13, skipping insertion in model container [2019-12-28 01:56:13,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:56:13" (3/3) ... [2019-12-28 01:56:13,251 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_pso.opt.i [2019-12-28 01:56:13,259 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 01:56:13,260 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 01:56:13,269 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 01:56:13,270 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 01:56:13,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,307 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,308 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,311 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,343 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,343 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,350 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,351 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,351 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,362 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,363 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,364 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,390 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,392 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:56:13,410 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-28 01:56:13,431 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 01:56:13,431 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 01:56:13,432 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 01:56:13,432 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 01:56:13,432 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 01:56:13,432 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 01:56:13,432 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 01:56:13,432 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 01:56:13,454 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 181 transitions [2019-12-28 01:56:30,824 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111191 states. [2019-12-28 01:56:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 111191 states. [2019-12-28 01:56:30,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 01:56:30,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:30,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:30,844 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-28 01:56:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:30,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1481943775, now seen corresponding path program 1 times [2019-12-28 01:56:30,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:30,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995332057] [2019-12-28 01:56:30,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:31,269 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-28 01:56:31,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995332057] [2019-12-28 01:56:31,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:31,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:56:31,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1348836669] [2019-12-28 01:56:31,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:31,284 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:31,309 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 50 transitions. [2019-12-28 01:56:31,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:31,314 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:31,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:56:31,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:31,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:56:31,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:56:31,328 INFO L87 Difference]: Start difference. First operand 111191 states. Second operand 4 states. [2019-12-28 01:56:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:33,181 INFO L93 Difference]: Finished difference Result 114119 states and 522355 transitions. [2019-12-28 01:56:33,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:56:33,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-28 01:56:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:37,121 INFO L225 Difference]: With dead ends: 114119 [2019-12-28 01:56:37,121 INFO L226 Difference]: Without dead ends: 82839 [2019-12-28 01:56:37,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:56:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82839 states. [2019-12-28 01:56:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82839 to 82839. [2019-12-28 01:56:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82839 states. [2019-12-28 01:56:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82839 states to 82839 states and 380415 transitions. [2019-12-28 01:56:44,587 INFO L78 Accepts]: Start accepts. Automaton has 82839 states and 380415 transitions. Word has length 50 [2019-12-28 01:56:44,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:44,589 INFO L462 AbstractCegarLoop]: Abstraction has 82839 states and 380415 transitions. [2019-12-28 01:56:44,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:56:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 82839 states and 380415 transitions. [2019-12-28 01:56:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-28 01:56:44,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:44,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:44,621 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-28 01:56:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1380811791, now seen corresponding path program 1 times [2019-12-28 01:56:44,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:44,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461819467] [2019-12-28 01:56:44,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:44,807 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-28 01:56:44,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461819467] [2019-12-28 01:56:44,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:44,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:44,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1258073578] [2019-12-28 01:56:44,808 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:44,815 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:44,821 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-28 01:56:44,821 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:44,822 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:44,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:56:44,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:44,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:56:44,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:56:44,824 INFO L87 Difference]: Start difference. First operand 82839 states and 380415 transitions. Second operand 5 states. [2019-12-28 01:56:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:46,189 INFO L93 Difference]: Finished difference Result 129239 states and 566707 transitions. [2019-12-28 01:56:46,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:56:46,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-28 01:56:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:50,742 INFO L225 Difference]: With dead ends: 129239 [2019-12-28 01:56:50,743 INFO L226 Difference]: Without dead ends: 126479 [2019-12-28 01:56:50,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:56:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126479 states. [2019-12-28 01:56:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126479 to 119963. [2019-12-28 01:56:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119963 states. [2019-12-28 01:56:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119963 states to 119963 states and 531554 transitions. [2019-12-28 01:56:54,744 INFO L78 Accepts]: Start accepts. Automaton has 119963 states and 531554 transitions. Word has length 58 [2019-12-28 01:56:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:54,745 INFO L462 AbstractCegarLoop]: Abstraction has 119963 states and 531554 transitions. [2019-12-28 01:56:54,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:56:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 119963 states and 531554 transitions. [2019-12-28 01:56:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-28 01:56:54,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:54,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:54,762 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-28 01:56:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:54,763 INFO L82 PathProgramCache]: Analyzing trace with hash -447711961, now seen corresponding path program 1 times [2019-12-28 01:56:54,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:54,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781640635] [2019-12-28 01:56:54,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:54,962 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-28 01:56:54,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781640635] [2019-12-28 01:56:54,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:54,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:54,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2070983097] [2019-12-28 01:56:54,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:54,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:54,986 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 131 transitions. [2019-12-28 01:56:54,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:54,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:54,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:56:54,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:56:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:56:54,992 INFO L87 Difference]: Start difference. First operand 119963 states and 531554 transitions. Second operand 5 states. [2019-12-28 01:57:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:57:00,463 INFO L93 Difference]: Finished difference Result 156375 states and 680703 transitions. [2019-12-28 01:57:00,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:57:00,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-28 01:57:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:57:00,966 INFO L225 Difference]: With dead ends: 156375 [2019-12-28 01:57:00,966 INFO L226 Difference]: Without dead ends: 154135 [2019-12-28 01:57:00,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:57:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154135 states. [2019-12-28 01:57:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154135 to 132947. [2019-12-28 01:57:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132947 states. [2019-12-28 01:57:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132947 states to 132947 states and 585328 transitions. [2019-12-28 01:57:05,886 INFO L78 Accepts]: Start accepts. Automaton has 132947 states and 585328 transitions. Word has length 59 [2019-12-28 01:57:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:57:05,887 INFO L462 AbstractCegarLoop]: Abstraction has 132947 states and 585328 transitions. [2019-12-28 01:57:05,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:57:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 132947 states and 585328 transitions. [2019-12-28 01:57:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 01:57:05,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:57:05,911 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] [2019-12-28 01:57:05,911 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-28 01:57:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:57:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash -429000659, now seen corresponding path program 1 times [2019-12-28 01:57:05,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:57:05,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671874409] [2019-12-28 01:57:05,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:57:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:57:05,986 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-28 01:57:05,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671874409] [2019-12-28 01:57:05,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:57:05,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:57:05,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9518956] [2019-12-28 01:57:05,988 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:57:05,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:57:06,010 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 149 transitions. [2019-12-28 01:57:06,010 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:57:06,082 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:57:06,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:57:06,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:57:06,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:57:06,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:57:06,083 INFO L87 Difference]: Start difference. First operand 132947 states and 585328 transitions. Second operand 4 states. [2019-12-28 01:57:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:57:12,064 INFO L93 Difference]: Finished difference Result 171279 states and 741345 transitions. [2019-12-28 01:57:12,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:57:12,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-28 01:57:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:57:12,791 INFO L225 Difference]: With dead ends: 171279 [2019-12-28 01:57:12,792 INFO L226 Difference]: Without dead ends: 171279 [2019-12-28 01:57:12,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:57:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171279 states. [2019-12-28 01:57:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171279 to 152003. [2019-12-28 01:57:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152003 states. [2019-12-28 01:57:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152003 states to 152003 states and 663356 transitions. [2019-12-28 01:57:18,684 INFO L78 Accepts]: Start accepts. Automaton has 152003 states and 663356 transitions. Word has length 61 [2019-12-28 01:57:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:57:18,684 INFO L462 AbstractCegarLoop]: Abstraction has 152003 states and 663356 transitions. [2019-12-28 01:57:18,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:57:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand 152003 states and 663356 transitions. [2019-12-28 01:57:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:57:18,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:57:18,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:57:18,783 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-28 01:57:18,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:57:18,784 INFO L82 PathProgramCache]: Analyzing trace with hash -246058056, now seen corresponding path program 1 times [2019-12-28 01:57:18,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:57:18,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599505698] [2019-12-28 01:57:18,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:57:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:57:18,926 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-28 01:57:18,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599505698] [2019-12-28 01:57:18,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:57:18,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:57:18,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [891519571] [2019-12-28 01:57:18,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:57:18,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:57:23,569 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 185 transitions. [2019-12-28 01:57:23,569 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:57:23,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:57:23,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:57:23,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:57:23,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:57:23,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:57:23,629 INFO L87 Difference]: Start difference. First operand 152003 states and 663356 transitions. Second operand 8 states. [2019-12-28 01:57:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:57:26,058 INFO L93 Difference]: Finished difference Result 196527 states and 843641 transitions. [2019-12-28 01:57:26,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 01:57:26,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-28 01:57:26,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:57:26,783 INFO L225 Difference]: With dead ends: 196527 [2019-12-28 01:57:26,783 INFO L226 Difference]: Without dead ends: 193927 [2019-12-28 01:57:26,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 01:57:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193927 states. [2019-12-28 01:57:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193927 to 153899. [2019-12-28 01:57:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153899 states. [2019-12-28 01:57:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153899 states to 153899 states and 672398 transitions. [2019-12-28 01:57:37,727 INFO L78 Accepts]: Start accepts. Automaton has 153899 states and 672398 transitions. Word has length 65 [2019-12-28 01:57:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:57:37,727 INFO L462 AbstractCegarLoop]: Abstraction has 153899 states and 672398 transitions. [2019-12-28 01:57:37,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:57:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 153899 states and 672398 transitions. [2019-12-28 01:57:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:57:37,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:57:37,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:57:37,770 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-28 01:57:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:57:37,770 INFO L82 PathProgramCache]: Analyzing trace with hash 445459117, now seen corresponding path program 1 times [2019-12-28 01:57:37,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:57:37,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471433521] [2019-12-28 01:57:37,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:57:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:57:37,920 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-28 01:57:37,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471433521] [2019-12-28 01:57:37,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:57:37,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:57:37,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249635552] [2019-12-28 01:57:37,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:57:37,929 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:57:37,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 69 transitions. [2019-12-28 01:57:37,939 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:57:37,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:57:37,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:57:37,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:57:37,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:57:37,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:57:37,961 INFO L87 Difference]: Start difference. First operand 153899 states and 672398 transitions. Second operand 8 states. [2019-12-28 01:57:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:57:46,037 INFO L93 Difference]: Finished difference Result 213003 states and 921030 transitions. [2019-12-28 01:57:46,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:57:46,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-28 01:57:46,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:57:46,769 INFO L225 Difference]: With dead ends: 213003 [2019-12-28 01:57:46,770 INFO L226 Difference]: Without dead ends: 209099 [2019-12-28 01:57:46,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:57:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209099 states. [2019-12-28 01:57:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209099 to 196111. [2019-12-28 01:57:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196111 states. [2019-12-28 01:57:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196111 states to 196111 states and 850981 transitions. [2019-12-28 01:57:53,064 INFO L78 Accepts]: Start accepts. Automaton has 196111 states and 850981 transitions. Word has length 65 [2019-12-28 01:57:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:57:53,065 INFO L462 AbstractCegarLoop]: Abstraction has 196111 states and 850981 transitions. [2019-12-28 01:57:53,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:57:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 196111 states and 850981 transitions. [2019-12-28 01:57:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:57:53,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:57:53,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:57:53,117 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-28 01:57:53,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:57:53,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1351492242, now seen corresponding path program 1 times [2019-12-28 01:57:53,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:57:53,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824964861] [2019-12-28 01:57:53,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:57:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:57:53,228 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-28 01:57:53,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824964861] [2019-12-28 01:57:53,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:57:53,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:57:53,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [992825871] [2019-12-28 01:57:53,230 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:57:53,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:57:53,246 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 69 transitions. [2019-12-28 01:57:53,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:57:53,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:57:53,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:57:53,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:57:53,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:57:53,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:57:53,277 INFO L87 Difference]: Start difference. First operand 196111 states and 850981 transitions. Second operand 9 states. [2019-12-28 01:58:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:05,678 INFO L93 Difference]: Finished difference Result 284571 states and 1194514 transitions. [2019-12-28 01:58:05,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 01:58:05,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-28 01:58:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:06,673 INFO L225 Difference]: With dead ends: 284571 [2019-12-28 01:58:06,673 INFO L226 Difference]: Without dead ends: 284571 [2019-12-28 01:58:06,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:58:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284571 states. [2019-12-28 01:58:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284571 to 232543. [2019-12-28 01:58:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232543 states. [2019-12-28 01:58:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232543 states to 232543 states and 990001 transitions. [2019-12-28 01:58:14,445 INFO L78 Accepts]: Start accepts. Automaton has 232543 states and 990001 transitions. Word has length 65 [2019-12-28 01:58:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:14,446 INFO L462 AbstractCegarLoop]: Abstraction has 232543 states and 990001 transitions. [2019-12-28 01:58:14,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:58:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 232543 states and 990001 transitions. [2019-12-28 01:58:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:58:14,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:14,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:14,494 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-28 01:58:14,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:14,494 INFO L82 PathProgramCache]: Analyzing trace with hash -463988561, now seen corresponding path program 1 times [2019-12-28 01:58:14,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:14,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618351674] [2019-12-28 01:58:14,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:14,568 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-28 01:58:14,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618351674] [2019-12-28 01:58:14,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:14,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:58:14,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1692879198] [2019-12-28 01:58:14,569 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:14,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:14,586 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 69 transitions. [2019-12-28 01:58:14,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:14,587 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:14,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:58:14,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:14,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:58:14,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:58:14,588 INFO L87 Difference]: Start difference. First operand 232543 states and 990001 transitions. Second operand 4 states. [2019-12-28 01:58:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:22,334 INFO L93 Difference]: Finished difference Result 189770 states and 786511 transitions. [2019-12-28 01:58:22,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:58:22,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-28 01:58:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:22,924 INFO L225 Difference]: With dead ends: 189770 [2019-12-28 01:58:22,924 INFO L226 Difference]: Without dead ends: 183774 [2019-12-28 01:58:22,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-28 01:58:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183774 states. [2019-12-28 01:58:27,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183774 to 183774. [2019-12-28 01:58:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183774 states. [2019-12-28 01:58:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183774 states to 183774 states and 765841 transitions. [2019-12-28 01:58:28,551 INFO L78 Accepts]: Start accepts. Automaton has 183774 states and 765841 transitions. Word has length 65 [2019-12-28 01:58:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:28,552 INFO L462 AbstractCegarLoop]: Abstraction has 183774 states and 765841 transitions. [2019-12-28 01:58:28,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:58:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 183774 states and 765841 transitions. [2019-12-28 01:58:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 01:58:28,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:28,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:28,593 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-28 01:58:28,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:28,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1777887569, now seen corresponding path program 1 times [2019-12-28 01:58:28,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:28,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274073000] [2019-12-28 01:58:28,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:28,664 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-28 01:58:28,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274073000] [2019-12-28 01:58:28,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:28,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:58:28,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1744217746] [2019-12-28 01:58:28,666 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:28,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:28,689 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 88 transitions. [2019-12-28 01:58:28,689 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:28,690 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:28,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:58:28,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:28,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:58:28,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:58:28,691 INFO L87 Difference]: Start difference. First operand 183774 states and 765841 transitions. Second operand 3 states. [2019-12-28 01:58:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:34,637 INFO L93 Difference]: Finished difference Result 139581 states and 577901 transitions. [2019-12-28 01:58:34,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:58:34,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-28 01:58:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:35,101 INFO L225 Difference]: With dead ends: 139581 [2019-12-28 01:58:35,101 INFO L226 Difference]: Without dead ends: 138069 [2019-12-28 01:58:35,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-28 01:58:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138069 states. [2019-12-28 01:58:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138069 to 133155. [2019-12-28 01:58:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133155 states. [2019-12-28 01:58:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133155 states to 133155 states and 553583 transitions. [2019-12-28 01:58:39,062 INFO L78 Accepts]: Start accepts. Automaton has 133155 states and 553583 transitions. Word has length 66 [2019-12-28 01:58:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:39,062 INFO L462 AbstractCegarLoop]: Abstraction has 133155 states and 553583 transitions. [2019-12-28 01:58:39,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:58:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 133155 states and 553583 transitions. [2019-12-28 01:58:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:58:39,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:39,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:39,100 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-28 01:58:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash -356129489, now seen corresponding path program 1 times [2019-12-28 01:58:39,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:39,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983603966] [2019-12-28 01:58:39,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:39,191 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-28 01:58:39,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983603966] [2019-12-28 01:58:39,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:39,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:58:39,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [71205965] [2019-12-28 01:58:39,192 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:39,200 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:39,210 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 83 transitions. [2019-12-28 01:58:39,211 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:39,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:39,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:58:39,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:39,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:58:39,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:58:39,212 INFO L87 Difference]: Start difference. First operand 133155 states and 553583 transitions. Second operand 5 states. [2019-12-28 01:58:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:39,420 INFO L93 Difference]: Finished difference Result 26547 states and 98280 transitions. [2019-12-28 01:58:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 01:58:39,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-28 01:58:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:39,482 INFO L225 Difference]: With dead ends: 26547 [2019-12-28 01:58:39,483 INFO L226 Difference]: Without dead ends: 22041 [2019-12-28 01:58:39,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-28 01:58:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22041 states. [2019-12-28 01:58:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22041 to 21849. [2019-12-28 01:58:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21849 states. [2019-12-28 01:58:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21849 states to 21849 states and 79588 transitions. [2019-12-28 01:58:40,781 INFO L78 Accepts]: Start accepts. Automaton has 21849 states and 79588 transitions. Word has length 67 [2019-12-28 01:58:40,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:40,782 INFO L462 AbstractCegarLoop]: Abstraction has 21849 states and 79588 transitions. [2019-12-28 01:58:40,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:58:40,782 INFO L276 IsEmpty]: Start isEmpty. Operand 21849 states and 79588 transitions. [2019-12-28 01:58:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-28 01:58:40,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:40,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:40,792 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-28 01:58:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1222369499, now seen corresponding path program 1 times [2019-12-28 01:58:40,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:40,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780378871] [2019-12-28 01:58:40,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:40,848 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-28 01:58:40,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780378871] [2019-12-28 01:58:40,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:40,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:58:40,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [382254019] [2019-12-28 01:58:40,849 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:40,862 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:40,901 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 228 transitions. [2019-12-28 01:58:40,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:40,902 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:40,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:58:40,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:58:40,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:58:40,903 INFO L87 Difference]: Start difference. First operand 21849 states and 79588 transitions. Second operand 4 states. [2019-12-28 01:58:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:41,118 INFO L93 Difference]: Finished difference Result 25695 states and 92964 transitions. [2019-12-28 01:58:41,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:58:41,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-28 01:58:41,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:41,172 INFO L225 Difference]: With dead ends: 25695 [2019-12-28 01:58:41,172 INFO L226 Difference]: Without dead ends: 25695 [2019-12-28 01:58:41,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 01:58:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25695 states. [2019-12-28 01:58:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25695 to 23607. [2019-12-28 01:58:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23607 states. [2019-12-28 01:58:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23607 states to 23607 states and 85590 transitions. [2019-12-28 01:58:41,584 INFO L78 Accepts]: Start accepts. Automaton has 23607 states and 85590 transitions. Word has length 76 [2019-12-28 01:58:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:41,585 INFO L462 AbstractCegarLoop]: Abstraction has 23607 states and 85590 transitions. [2019-12-28 01:58:41,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:58:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23607 states and 85590 transitions. [2019-12-28 01:58:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-28 01:58:41,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:41,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:41,597 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-28 01:58:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:41,598 INFO L82 PathProgramCache]: Analyzing trace with hash 520440836, now seen corresponding path program 1 times [2019-12-28 01:58:41,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:41,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001452900] [2019-12-28 01:58:41,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:41,672 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-28 01:58:41,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001452900] [2019-12-28 01:58:41,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:41,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:58:41,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1770917479] [2019-12-28 01:58:41,673 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:41,686 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:41,726 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 228 transitions. [2019-12-28 01:58:41,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:41,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:41,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:58:41,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:41,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:58:41,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:58:41,729 INFO L87 Difference]: Start difference. First operand 23607 states and 85590 transitions. Second operand 6 states. [2019-12-28 01:58:43,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:43,717 INFO L93 Difference]: Finished difference Result 30243 states and 108463 transitions. [2019-12-28 01:58:43,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:58:43,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-12-28 01:58:43,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:43,774 INFO L225 Difference]: With dead ends: 30243 [2019-12-28 01:58:43,774 INFO L226 Difference]: Without dead ends: 30063 [2019-12-28 01:58:43,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:58:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30063 states. [2019-12-28 01:58:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30063 to 26285. [2019-12-28 01:58:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26285 states. [2019-12-28 01:58:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26285 states to 26285 states and 94910 transitions. [2019-12-28 01:58:44,204 INFO L78 Accepts]: Start accepts. Automaton has 26285 states and 94910 transitions. Word has length 76 [2019-12-28 01:58:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:44,204 INFO L462 AbstractCegarLoop]: Abstraction has 26285 states and 94910 transitions. [2019-12-28 01:58:44,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:58:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 26285 states and 94910 transitions. [2019-12-28 01:58:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:44,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:44,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:44,222 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-28 01:58:44,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1316883782, now seen corresponding path program 1 times [2019-12-28 01:58:44,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:44,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811674866] [2019-12-28 01:58:44,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:44,295 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-28 01:58:44,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811674866] [2019-12-28 01:58:44,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:44,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:58:44,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994788525] [2019-12-28 01:58:44,296 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:44,311 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:44,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:44,334 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:44,335 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:44,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:58:44,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:44,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:58:44,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:58:44,336 INFO L87 Difference]: Start difference. First operand 26285 states and 94910 transitions. Second operand 4 states. [2019-12-28 01:58:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:44,647 INFO L93 Difference]: Finished difference Result 34919 states and 124771 transitions. [2019-12-28 01:58:44,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:58:44,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-28 01:58:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:44,710 INFO L225 Difference]: With dead ends: 34919 [2019-12-28 01:58:44,710 INFO L226 Difference]: Without dead ends: 34919 [2019-12-28 01:58:44,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:58:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34919 states. [2019-12-28 01:58:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34919 to 29738. [2019-12-28 01:58:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29738 states. [2019-12-28 01:58:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29738 states to 29738 states and 106663 transitions. [2019-12-28 01:58:45,521 INFO L78 Accepts]: Start accepts. Automaton has 29738 states and 106663 transitions. Word has length 80 [2019-12-28 01:58:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:45,521 INFO L462 AbstractCegarLoop]: Abstraction has 29738 states and 106663 transitions. [2019-12-28 01:58:45,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:58:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 29738 states and 106663 transitions. [2019-12-28 01:58:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:45,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:45,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:45,547 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-28 01:58:45,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:45,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1733319033, now seen corresponding path program 1 times [2019-12-28 01:58:45,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:45,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552472798] [2019-12-28 01:58:45,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:45,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-28 01:58:45,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552472798] [2019-12-28 01:58:45,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:45,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:58:45,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [30359298] [2019-12-28 01:58:45,666 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:45,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:45,704 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:45,704 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:45,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:58:45,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:58:45,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:45,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:58:45,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:58:45,707 INFO L87 Difference]: Start difference. First operand 29738 states and 106663 transitions. Second operand 6 states. [2019-12-28 01:58:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:46,376 INFO L93 Difference]: Finished difference Result 34483 states and 121692 transitions. [2019-12-28 01:58:46,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:58:46,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-28 01:58:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:46,441 INFO L225 Difference]: With dead ends: 34483 [2019-12-28 01:58:46,441 INFO L226 Difference]: Without dead ends: 34483 [2019-12-28 01:58:46,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:58:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34483 states. [2019-12-28 01:58:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34483 to 33418. [2019-12-28 01:58:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33418 states. [2019-12-28 01:58:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33418 states to 33418 states and 118241 transitions. [2019-12-28 01:58:46,983 INFO L78 Accepts]: Start accepts. Automaton has 33418 states and 118241 transitions. Word has length 80 [2019-12-28 01:58:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:46,983 INFO L462 AbstractCegarLoop]: Abstraction has 33418 states and 118241 transitions. [2019-12-28 01:58:46,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:58:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 33418 states and 118241 transitions. [2019-12-28 01:58:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:47,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:47,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:47,008 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-28 01:58:47,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:47,008 INFO L82 PathProgramCache]: Analyzing trace with hash 484438920, now seen corresponding path program 1 times [2019-12-28 01:58:47,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:47,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711431145] [2019-12-28 01:58:47,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:47,307 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-12-28 01:58:47,343 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-28 01:58:47,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711431145] [2019-12-28 01:58:47,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:47,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:58:47,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [93248754] [2019-12-28 01:58:47,344 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:47,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:47,382 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:47,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:47,383 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:47,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:58:47,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:47,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:58:47,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:58:47,384 INFO L87 Difference]: Start difference. First operand 33418 states and 118241 transitions. Second operand 6 states. [2019-12-28 01:58:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:47,914 INFO L93 Difference]: Finished difference Result 39886 states and 137569 transitions. [2019-12-28 01:58:47,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:58:47,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-28 01:58:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:47,987 INFO L225 Difference]: With dead ends: 39886 [2019-12-28 01:58:47,987 INFO L226 Difference]: Without dead ends: 39886 [2019-12-28 01:58:47,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:58:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39886 states. [2019-12-28 01:58:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39886 to 34246. [2019-12-28 01:58:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34246 states. [2019-12-28 01:58:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34246 states to 34246 states and 119107 transitions. [2019-12-28 01:58:48,571 INFO L78 Accepts]: Start accepts. Automaton has 34246 states and 119107 transitions. Word has length 80 [2019-12-28 01:58:48,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:48,571 INFO L462 AbstractCegarLoop]: Abstraction has 34246 states and 119107 transitions. [2019-12-28 01:58:48,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:58:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 34246 states and 119107 transitions. [2019-12-28 01:58:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:48,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:48,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:58:48,598 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-28 01:58:48,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:48,598 INFO L82 PathProgramCache]: Analyzing trace with hash 695789833, now seen corresponding path program 1 times [2019-12-28 01:58:48,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:48,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438208903] [2019-12-28 01:58:48,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:48,664 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-28 01:58:48,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438208903] [2019-12-28 01:58:48,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:48,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:58:48,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [184404679] [2019-12-28 01:58:48,666 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:48,679 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:48,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:48,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:48,703 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:58:48,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:58:48,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:48,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:58:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:58:48,704 INFO L87 Difference]: Start difference. First operand 34246 states and 119107 transitions. Second operand 5 states. [2019-12-28 01:58:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:49,528 INFO L93 Difference]: Finished difference Result 41651 states and 144391 transitions. [2019-12-28 01:58:49,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:58:49,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-28 01:58:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:49,651 INFO L225 Difference]: With dead ends: 41651 [2019-12-28 01:58:49,651 INFO L226 Difference]: Without dead ends: 41651 [2019-12-28 01:58:49,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:58:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41651 states. [2019-12-28 01:58:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41651 to 36968. [2019-12-28 01:58:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36968 states. [2019-12-28 01:58:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36968 states to 36968 states and 127710 transitions. [2019-12-28 01:58:50,568 INFO L78 Accepts]: Start accepts. Automaton has 36968 states and 127710 transitions. Word has length 80 [2019-12-28 01:58:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:50,568 INFO L462 AbstractCegarLoop]: Abstraction has 36968 states and 127710 transitions. [2019-12-28 01:58:50,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:58:50,568 INFO L276 IsEmpty]: Start isEmpty. Operand 36968 states and 127710 transitions. [2019-12-28 01:58:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:50,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:50,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:50,597 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-28 01:58:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:50,597 INFO L82 PathProgramCache]: Analyzing trace with hash 185255656, now seen corresponding path program 1 times [2019-12-28 01:58:50,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:50,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692442442] [2019-12-28 01:58:50,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:50,676 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-28 01:58:50,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692442442] [2019-12-28 01:58:50,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:50,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:58:50,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [764613433] [2019-12-28 01:58:50,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:50,695 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:50,723 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:50,723 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:50,724 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:50,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:58:50,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:50,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:58:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:58:50,725 INFO L87 Difference]: Start difference. First operand 36968 states and 127710 transitions. Second operand 4 states. [2019-12-28 01:58:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:51,336 INFO L93 Difference]: Finished difference Result 44717 states and 154917 transitions. [2019-12-28 01:58:51,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:58:51,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-28 01:58:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:51,430 INFO L225 Difference]: With dead ends: 44717 [2019-12-28 01:58:51,430 INFO L226 Difference]: Without dead ends: 43574 [2019-12-28 01:58:51,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 01:58:51,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43574 states. [2019-12-28 01:58:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43574 to 41927. [2019-12-28 01:58:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41927 states. [2019-12-28 01:58:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41927 states to 41927 states and 144888 transitions. [2019-12-28 01:58:52,424 INFO L78 Accepts]: Start accepts. Automaton has 41927 states and 144888 transitions. Word has length 80 [2019-12-28 01:58:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:52,425 INFO L462 AbstractCegarLoop]: Abstraction has 41927 states and 144888 transitions. [2019-12-28 01:58:52,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:58:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 41927 states and 144888 transitions. [2019-12-28 01:58:52,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:52,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:52,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:52,456 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-28 01:58:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:52,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1611695703, now seen corresponding path program 1 times [2019-12-28 01:58:52,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:52,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783393374] [2019-12-28 01:58:52,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:52,571 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-28 01:58:52,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783393374] [2019-12-28 01:58:52,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:52,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:58:52,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1133335524] [2019-12-28 01:58:52,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:52,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:52,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:52,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:52,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:52,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:58:52,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:52,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:58:52,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:58:52,609 INFO L87 Difference]: Start difference. First operand 41927 states and 144888 transitions. Second operand 7 states. [2019-12-28 01:58:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:53,281 INFO L93 Difference]: Finished difference Result 50830 states and 173172 transitions. [2019-12-28 01:58:53,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 01:58:53,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-28 01:58:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:53,413 INFO L225 Difference]: With dead ends: 50830 [2019-12-28 01:58:53,414 INFO L226 Difference]: Without dead ends: 50830 [2019-12-28 01:58:53,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:58:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50830 states. [2019-12-28 01:58:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50830 to 39793. [2019-12-28 01:58:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39793 states. [2019-12-28 01:58:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39793 states to 39793 states and 135816 transitions. [2019-12-28 01:58:54,446 INFO L78 Accepts]: Start accepts. Automaton has 39793 states and 135816 transitions. Word has length 80 [2019-12-28 01:58:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:54,446 INFO L462 AbstractCegarLoop]: Abstraction has 39793 states and 135816 transitions. [2019-12-28 01:58:54,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:58:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 39793 states and 135816 transitions. [2019-12-28 01:58:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:54,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:54,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:54,473 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:54,473 INFO L82 PathProgramCache]: Analyzing trace with hash -724192022, now seen corresponding path program 1 times [2019-12-28 01:58:54,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:54,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776488757] [2019-12-28 01:58:54,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:54,549 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-28 01:58:54,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776488757] [2019-12-28 01:58:54,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:54,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:58:54,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1741752325] [2019-12-28 01:58:54,551 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:54,565 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:54,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:54,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:54,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:54,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:58:54,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:54,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:58:54,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:58:54,592 INFO L87 Difference]: Start difference. First operand 39793 states and 135816 transitions. Second operand 6 states. [2019-12-28 01:58:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:54,702 INFO L93 Difference]: Finished difference Result 15205 states and 46377 transitions. [2019-12-28 01:58:54,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:58:54,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-28 01:58:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:54,721 INFO L225 Difference]: With dead ends: 15205 [2019-12-28 01:58:54,721 INFO L226 Difference]: Without dead ends: 13056 [2019-12-28 01:58:54,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-28 01:58:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13056 states. [2019-12-28 01:58:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13056 to 12016. [2019-12-28 01:58:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12016 states. [2019-12-28 01:58:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12016 states to 12016 states and 36483 transitions. [2019-12-28 01:58:54,884 INFO L78 Accepts]: Start accepts. Automaton has 12016 states and 36483 transitions. Word has length 80 [2019-12-28 01:58:54,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:54,884 INFO L462 AbstractCegarLoop]: Abstraction has 12016 states and 36483 transitions. [2019-12-28 01:58:54,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:58:54,885 INFO L276 IsEmpty]: Start isEmpty. Operand 12016 states and 36483 transitions. [2019-12-28 01:58:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:58:54,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:54,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:58:54,899 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:54,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:54,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1499343217, now seen corresponding path program 1 times [2019-12-28 01:58:54,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:54,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625453463] [2019-12-28 01:58:54,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:55,004 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-28 01:58:55,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625453463] [2019-12-28 01:58:55,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:55,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:58:55,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [767415775] [2019-12-28 01:58:55,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:55,024 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:55,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 311 transitions. [2019-12-28 01:58:55,130 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:55,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 01:58:55,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:58:55,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:55,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:58:55,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:58:55,178 INFO L87 Difference]: Start difference. First operand 12016 states and 36483 transitions. Second operand 10 states. [2019-12-28 01:58:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:56,590 INFO L93 Difference]: Finished difference Result 24183 states and 72345 transitions. [2019-12-28 01:58:56,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-28 01:58:56,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-28 01:58:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:56,638 INFO L225 Difference]: With dead ends: 24183 [2019-12-28 01:58:56,639 INFO L226 Difference]: Without dead ends: 23995 [2019-12-28 01:58:56,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-12-28 01:58:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23995 states. [2019-12-28 01:58:57,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23995 to 13312. [2019-12-28 01:58:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13312 states. [2019-12-28 01:58:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13312 states to 13312 states and 40395 transitions. [2019-12-28 01:58:57,124 INFO L78 Accepts]: Start accepts. Automaton has 13312 states and 40395 transitions. Word has length 97 [2019-12-28 01:58:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:57,125 INFO L462 AbstractCegarLoop]: Abstraction has 13312 states and 40395 transitions. [2019-12-28 01:58:57,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:58:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 13312 states and 40395 transitions. [2019-12-28 01:58:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:58:57,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:57,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:58:57,152 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash -577866126, now seen corresponding path program 1 times [2019-12-28 01:58:57,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:57,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737460860] [2019-12-28 01:58:57,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:57,411 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-28 01:58:57,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737460860] [2019-12-28 01:58:57,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:57,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:58:57,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [73312771] [2019-12-28 01:58:57,412 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:57,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:57,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 311 transitions. [2019-12-28 01:58:57,593 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:57,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:58:57,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:58:57,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:57,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:58:57,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:58:57,664 INFO L87 Difference]: Start difference. First operand 13312 states and 40395 transitions. Second operand 9 states. [2019-12-28 01:58:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:58,287 INFO L93 Difference]: Finished difference Result 26647 states and 79748 transitions. [2019-12-28 01:58:58,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 01:58:58,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-28 01:58:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:58,343 INFO L225 Difference]: With dead ends: 26647 [2019-12-28 01:58:58,344 INFO L226 Difference]: Without dead ends: 23791 [2019-12-28 01:58:58,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-12-28 01:58:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23791 states. [2019-12-28 01:58:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23791 to 14677. [2019-12-28 01:58:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14677 states. [2019-12-28 01:58:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14677 states to 14677 states and 44477 transitions. [2019-12-28 01:58:58,837 INFO L78 Accepts]: Start accepts. Automaton has 14677 states and 44477 transitions. Word has length 97 [2019-12-28 01:58:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:58,838 INFO L462 AbstractCegarLoop]: Abstraction has 14677 states and 44477 transitions. [2019-12-28 01:58:58,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:58:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 14677 states and 44477 transitions. [2019-12-28 01:58:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:58:58,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:58,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:58:58,870 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:58,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:58,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1737016014, now seen corresponding path program 2 times [2019-12-28 01:58:58,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:58,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78279976] [2019-12-28 01:58:58,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:59,105 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-28 01:58:59,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78279976] [2019-12-28 01:58:59,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:59,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 01:58:59,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874863406] [2019-12-28 01:58:59,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:59,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:59,446 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 281 transitions. [2019-12-28 01:58:59,446 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:59,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:58:59,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-28 01:58:59,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:59,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-28 01:58:59,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:58:59,643 INFO L87 Difference]: Start difference. First operand 14677 states and 44477 transitions. Second operand 14 states. [2019-12-28 01:59:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:59:03,517 INFO L93 Difference]: Finished difference Result 53491 states and 160343 transitions. [2019-12-28 01:59:03,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-28 01:59:03,518 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-28 01:59:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:59:03,589 INFO L225 Difference]: With dead ends: 53491 [2019-12-28 01:59:03,590 INFO L226 Difference]: Without dead ends: 40543 [2019-12-28 01:59:03,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=443, Invalid=2007, Unknown=0, NotChecked=0, Total=2450 [2019-12-28 01:59:03,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40543 states. [2019-12-28 01:59:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40543 to 16835. [2019-12-28 01:59:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16835 states. [2019-12-28 01:59:04,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16835 states to 16835 states and 49851 transitions. [2019-12-28 01:59:04,005 INFO L78 Accepts]: Start accepts. Automaton has 16835 states and 49851 transitions. Word has length 97 [2019-12-28 01:59:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:59:04,005 INFO L462 AbstractCegarLoop]: Abstraction has 16835 states and 49851 transitions. [2019-12-28 01:59:04,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-28 01:59:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 16835 states and 49851 transitions. [2019-12-28 01:59:04,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:59:04,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:59:04,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:59:04,023 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:59:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:59:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1479895975, now seen corresponding path program 1 times [2019-12-28 01:59:04,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:59:04,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507562993] [2019-12-28 01:59:04,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:59:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:59:04,148 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-28 01:59:04,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507562993] [2019-12-28 01:59:04,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:59:04,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:59:04,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1509639530] [2019-12-28 01:59:04,151 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:59:04,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:59:04,397 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 302 transitions. [2019-12-28 01:59:04,398 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:59:04,399 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:59:04,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:59:04,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:59:04,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:59:04,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:59:04,400 INFO L87 Difference]: Start difference. First operand 16835 states and 49851 transitions. Second operand 7 states. [2019-12-28 01:59:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:59:04,609 INFO L93 Difference]: Finished difference Result 24974 states and 73910 transitions. [2019-12-28 01:59:04,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:59:04,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-28 01:59:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:59:04,636 INFO L225 Difference]: With dead ends: 24974 [2019-12-28 01:59:04,636 INFO L226 Difference]: Without dead ends: 13391 [2019-12-28 01:59:04,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:59:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13391 states. [2019-12-28 01:59:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13391 to 13391. [2019-12-28 01:59:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13391 states. [2019-12-28 01:59:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13391 states to 13391 states and 39337 transitions. [2019-12-28 01:59:04,854 INFO L78 Accepts]: Start accepts. Automaton has 13391 states and 39337 transitions. Word has length 97 [2019-12-28 01:59:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:59:04,854 INFO L462 AbstractCegarLoop]: Abstraction has 13391 states and 39337 transitions. [2019-12-28 01:59:04,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:59:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 13391 states and 39337 transitions. [2019-12-28 01:59:04,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:59:04,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:59:04,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:59:04,868 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:59:04,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:59:04,868 INFO L82 PathProgramCache]: Analyzing trace with hash 198905834, now seen corresponding path program 3 times [2019-12-28 01:59:04,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:59:04,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687149351] [2019-12-28 01:59:04,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:59:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:59:04,963 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-28 01:59:04,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687149351] [2019-12-28 01:59:04,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:59:04,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:59:04,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009743544] [2019-12-28 01:59:04,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:59:04,982 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:59:05,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 211 states and 313 transitions. [2019-12-28 01:59:05,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:59:05,119 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:59:05,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:59:05,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:59:05,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:59:05,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:59:05,120 INFO L87 Difference]: Start difference. First operand 13391 states and 39337 transitions. Second operand 8 states. [2019-12-28 01:59:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:59:05,464 INFO L93 Difference]: Finished difference Result 23071 states and 67577 transitions. [2019-12-28 01:59:05,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:59:05,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-28 01:59:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:59:05,479 INFO L225 Difference]: With dead ends: 23071 [2019-12-28 01:59:05,479 INFO L226 Difference]: Without dead ends: 9217 [2019-12-28 01:59:05,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:59:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2019-12-28 01:59:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 7383. [2019-12-28 01:59:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7383 states. [2019-12-28 01:59:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7383 states to 7383 states and 21650 transitions. [2019-12-28 01:59:05,584 INFO L78 Accepts]: Start accepts. Automaton has 7383 states and 21650 transitions. Word has length 97 [2019-12-28 01:59:05,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:59:05,585 INFO L462 AbstractCegarLoop]: Abstraction has 7383 states and 21650 transitions. [2019-12-28 01:59:05,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:59:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 7383 states and 21650 transitions. [2019-12-28 01:59:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:59:05,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:59:05,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:59:05,593 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:59:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:59:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1595895500, now seen corresponding path program 1 times [2019-12-28 01:59:05,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:59:05,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259083515] [2019-12-28 01:59:05,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:59:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:59:05,661 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-28 01:59:05,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259083515] [2019-12-28 01:59:05,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:59:05,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:59:05,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1701661058] [2019-12-28 01:59:05,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:59:05,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:59:05,755 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 185 transitions. [2019-12-28 01:59:05,755 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:59:05,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 01:59:05,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:59:05,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:59:05,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:59:05,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:59:05,790 INFO L87 Difference]: Start difference. First operand 7383 states and 21650 transitions. Second operand 7 states. [2019-12-28 01:59:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:59:06,570 INFO L93 Difference]: Finished difference Result 9877 states and 28138 transitions. [2019-12-28 01:59:06,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 01:59:06,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-28 01:59:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:59:06,584 INFO L225 Difference]: With dead ends: 9877 [2019-12-28 01:59:06,585 INFO L226 Difference]: Without dead ends: 9811 [2019-12-28 01:59:06,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:59:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9811 states. [2019-12-28 01:59:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9811 to 7059. [2019-12-28 01:59:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7059 states. [2019-12-28 01:59:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7059 states to 7059 states and 20141 transitions. [2019-12-28 01:59:06,742 INFO L78 Accepts]: Start accepts. Automaton has 7059 states and 20141 transitions. Word has length 97 [2019-12-28 01:59:06,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:59:06,742 INFO L462 AbstractCegarLoop]: Abstraction has 7059 states and 20141 transitions. [2019-12-28 01:59:06,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:59:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 7059 states and 20141 transitions. [2019-12-28 01:59:06,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:59:06,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:59:06,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:59:06,749 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:59:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:59:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1353524780, now seen corresponding path program 1 times [2019-12-28 01:59:06,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:59:06,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981898907] [2019-12-28 01:59:06,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:59:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:59:06,865 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-28 01:59:06,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981898907] [2019-12-28 01:59:06,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:59:06,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:59:06,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903044730] [2019-12-28 01:59:06,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:59:06,884 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:59:06,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 185 transitions. [2019-12-28 01:59:06,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:59:07,029 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 01:59:07,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:59:07,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:59:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:59:07,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:59:07,030 INFO L87 Difference]: Start difference. First operand 7059 states and 20141 transitions. Second operand 7 states. [2019-12-28 01:59:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:59:07,811 INFO L93 Difference]: Finished difference Result 9025 states and 25430 transitions. [2019-12-28 01:59:07,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:59:07,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-28 01:59:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:59:07,829 INFO L225 Difference]: With dead ends: 9025 [2019-12-28 01:59:07,829 INFO L226 Difference]: Without dead ends: 9025 [2019-12-28 01:59:07,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:59:07,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9025 states. [2019-12-28 01:59:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9025 to 7330. [2019-12-28 01:59:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7330 states. [2019-12-28 01:59:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7330 states to 7330 states and 20724 transitions. [2019-12-28 01:59:07,977 INFO L78 Accepts]: Start accepts. Automaton has 7330 states and 20724 transitions. Word has length 97 [2019-12-28 01:59:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:59:07,978 INFO L462 AbstractCegarLoop]: Abstraction has 7330 states and 20724 transitions. [2019-12-28 01:59:07,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:59:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7330 states and 20724 transitions. [2019-12-28 01:59:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:59:07,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:59:07,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:59:07,989 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:59:07,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:59:07,989 INFO L82 PathProgramCache]: Analyzing trace with hash -848906966, now seen corresponding path program 1 times [2019-12-28 01:59:07,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:59:07,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836878785] [2019-12-28 01:59:07,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:59:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:59:08,104 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-28 01:59:08,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836878785] [2019-12-28 01:59:08,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:59:08,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:59:08,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1796913408] [2019-12-28 01:59:08,105 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:59:08,123 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:59:08,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 193 transitions. [2019-12-28 01:59:08,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:59:08,338 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-28 01:59:08,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 01:59:08,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:59:08,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 01:59:08,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:59:08,339 INFO L87 Difference]: Start difference. First operand 7330 states and 20724 transitions. Second operand 11 states. [2019-12-28 01:59:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:59:10,193 INFO L93 Difference]: Finished difference Result 9215 states and 26050 transitions. [2019-12-28 01:59:10,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 01:59:10,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-28 01:59:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:59:10,207 INFO L225 Difference]: With dead ends: 9215 [2019-12-28 01:59:10,207 INFO L226 Difference]: Without dead ends: 9215 [2019-12-28 01:59:10,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2019-12-28 01:59:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9215 states. [2019-12-28 01:59:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9215 to 7360. [2019-12-28 01:59:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7360 states. [2019-12-28 01:59:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7360 states to 7360 states and 20717 transitions. [2019-12-28 01:59:10,309 INFO L78 Accepts]: Start accepts. Automaton has 7360 states and 20717 transitions. Word has length 97 [2019-12-28 01:59:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:59:10,309 INFO L462 AbstractCegarLoop]: Abstraction has 7360 states and 20717 transitions. [2019-12-28 01:59:10,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 01:59:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 7360 states and 20717 transitions. [2019-12-28 01:59:10,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:59:10,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:59:10,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:59:10,317 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:59:10,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:59:10,317 INFO L82 PathProgramCache]: Analyzing trace with hash -637556053, now seen corresponding path program 1 times [2019-12-28 01:59:10,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:59:10,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124771812] [2019-12-28 01:59:10,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:59:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:59:10,473 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-28 01:59:10,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124771812] [2019-12-28 01:59:10,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:59:10,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:59:10,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [960694700] [2019-12-28 01:59:10,474 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:59:10,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:59:10,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 193 transitions. [2019-12-28 01:59:10,602 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:59:10,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 01:59:10,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:59:10,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:59:10,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:59:10,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:59:10,667 INFO L87 Difference]: Start difference. First operand 7360 states and 20717 transitions. Second operand 10 states. [2019-12-28 01:59:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:59:11,619 INFO L93 Difference]: Finished difference Result 8780 states and 24707 transitions. [2019-12-28 01:59:11,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 01:59:11,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-28 01:59:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:59:11,632 INFO L225 Difference]: With dead ends: 8780 [2019-12-28 01:59:11,632 INFO L226 Difference]: Without dead ends: 8780 [2019-12-28 01:59:11,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-28 01:59:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8780 states. [2019-12-28 01:59:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8780 to 7387. [2019-12-28 01:59:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7387 states. [2019-12-28 01:59:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7387 states to 7387 states and 20774 transitions. [2019-12-28 01:59:11,731 INFO L78 Accepts]: Start accepts. Automaton has 7387 states and 20774 transitions. Word has length 97 [2019-12-28 01:59:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:59:11,732 INFO L462 AbstractCegarLoop]: Abstraction has 7387 states and 20774 transitions. [2019-12-28 01:59:11,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:59:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7387 states and 20774 transitions. [2019-12-28 01:59:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:59:11,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:59:11,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:59:11,739 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:59:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:59:11,740 INFO L82 PathProgramCache]: Analyzing trace with hash 249947628, now seen corresponding path program 4 times [2019-12-28 01:59:11,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:59:11,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705820172] [2019-12-28 01:59:11,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:59:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:59:11,880 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-28 01:59:11,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705820172] [2019-12-28 01:59:11,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:59:11,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 01:59:11,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1167608629] [2019-12-28 01:59:11,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:59:11,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:59:11,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 193 transitions. [2019-12-28 01:59:11,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:59:12,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:59:12,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 01:59:12,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:59:12,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 01:59:12,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:59:12,012 INFO L87 Difference]: Start difference. First operand 7387 states and 20774 transitions. Second operand 11 states. [2019-12-28 01:59:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:59:12,914 INFO L93 Difference]: Finished difference Result 13178 states and 37143 transitions. [2019-12-28 01:59:12,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 01:59:12,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-28 01:59:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:59:12,927 INFO L225 Difference]: With dead ends: 13178 [2019-12-28 01:59:12,927 INFO L226 Difference]: Without dead ends: 8993 [2019-12-28 01:59:12,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-28 01:59:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states. [2019-12-28 01:59:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 7324. [2019-12-28 01:59:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7324 states. [2019-12-28 01:59:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7324 states to 7324 states and 20606 transitions. [2019-12-28 01:59:13,026 INFO L78 Accepts]: Start accepts. Automaton has 7324 states and 20606 transitions. Word has length 97 [2019-12-28 01:59:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:59:13,026 INFO L462 AbstractCegarLoop]: Abstraction has 7324 states and 20606 transitions. [2019-12-28 01:59:13,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 01:59:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 7324 states and 20606 transitions. [2019-12-28 01:59:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:59:13,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:59:13,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:59:13,034 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:59:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:59:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1668225924, now seen corresponding path program 5 times [2019-12-28 01:59:13,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:59:13,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146388492] [2019-12-28 01:59:13,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:59:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:59:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:59:13,116 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 01:59:13,116 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 01:59:13,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:59:13 BasicIcfg [2019-12-28 01:59:13,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 01:59:13,331 INFO L168 Benchmark]: Toolchain (without parser) took 181878.41 ms. Allocated memory was 144.7 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.7 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-28 01:59:13,332 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 144.7 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-28 01:59:13,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.09 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.3 MB in the beginning and 155.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-28 01:59:13,333 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.43 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 152.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-28 01:59:13,339 INFO L168 Benchmark]: Boogie Preprocessor took 53.59 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 150.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-28 01:59:13,339 INFO L168 Benchmark]: RCFGBuilder took 847.56 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 105.9 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-28 01:59:13,340 INFO L168 Benchmark]: TraceAbstraction took 180080.65 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 962.3 MB. Max. memory is 7.1 GB. [2019-12-28 01:59:13,346 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.14 ms. Allocated memory is still 144.7 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 827.09 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.3 MB in the beginning and 155.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.43 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 152.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.59 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 150.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.56 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 105.9 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 180080.65 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 962.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L703] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L705] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L707] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L709] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L831] 0 pthread_t t858; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L832] FCALL, FORK 0 pthread_create(&t858, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L833] 0 pthread_t t859; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L834] FCALL, FORK 0 pthread_create(&t859, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L835] 0 pthread_t t860; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L836] FCALL, FORK 0 pthread_create(&t860, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L788] 3 z$w_buff1 = z$w_buff0 [L789] 3 z$w_buff0 = 1 [L790] 3 z$w_buff1_used = z$w_buff0_used [L791] 3 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 3 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L793] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L794] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L795] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L796] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = (_Bool)1 [L800] 3 a = 1 [L803] 3 __unbuffered_p2_EAX = a [L806] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L809] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L739] 1 b = 1 [L742] 1 __unbuffered_p0_EAX = x [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L754] 2 x = 1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L767] 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, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L809] 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) [L810] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used 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, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, 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$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used 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, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 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) [L811] 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 [L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L768] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L768] 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)) [L769] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L769] 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)) [L770] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L770] 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)) [L771] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L771] 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)) [L772] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L772] 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)) [L773] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L773] 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)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L775] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=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] [L775] 2 z = z$flush_delayed ? z$mem_tmp : z [L776] 2 z$flush_delayed = (_Bool)0 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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] [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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] [L842] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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] [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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] [L842] 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) [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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] [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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] [L844] 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 [L845] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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] [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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] [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 147 locations, 2 error locations. Result: UNSAFE, OverallTime: 179.6s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 83.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8604 SDtfs, 12814 SDslu, 28557 SDs, 0 SdLazy, 10800 SolverSat, 580 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 144 SyntacticMatches, 17 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232543occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 66.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 247992 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2400 NumberOfCodeBlocks, 2400 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2274 ConstructedInterpolants, 0 QuantifiedInterpolants, 545613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...