/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/rfi001_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:40:41,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:40:41,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:40:41,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:40:41,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:40:41,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:40:41,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:40:41,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:40:41,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:40:41,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:40:41,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:40:41,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:40:41,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:40:41,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:40:41,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:40:41,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:40:41,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:40:41,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:40:41,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:40:41,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:40:41,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:40:41,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:40:41,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:40:41,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:40:41,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:40:41,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:40:41,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:40:41,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:40:41,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:40:41,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:40:41,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:40:41,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:40:41,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:40:41,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:40:41,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:40:41,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:40:41,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:40:41,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:40:41,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:40:41,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:40:41,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:40:41,132 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 03:40:41,146 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:40:41,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:40:41,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:40:41,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:40:41,148 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:40:41,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:40:41,149 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:40:41,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:40:41,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:40:41,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:40:41,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:40:41,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:40:41,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:40:41,150 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:40:41,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:40:41,150 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:40:41,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:40:41,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:40:41,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:40:41,151 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:40:41,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:40:41,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:40:41,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:40:41,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:40:41,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:40:41,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:40:41,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:40:41,153 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:40:41,154 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:40:41,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:40:41,154 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:40:41,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:40:41,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:40:41,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:40:41,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:40:41,449 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:40:41,450 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:40:41,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.oepc.i [2019-12-28 03:40:41,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834616037/749d017b4a1d4c5c844026fdc09d1520/FLAG5036cc2eb [2019-12-28 03:40:42,056 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:40:42,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_rmo.oepc.i [2019-12-28 03:40:42,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834616037/749d017b4a1d4c5c844026fdc09d1520/FLAG5036cc2eb [2019-12-28 03:40:42,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834616037/749d017b4a1d4c5c844026fdc09d1520 [2019-12-28 03:40:42,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:40:42,381 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:40:42,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:40:42,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:40:42,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:40:42,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:40:42" (1/1) ... [2019-12-28 03:40:42,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4981dbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:42, skipping insertion in model container [2019-12-28 03:40:42,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:40:42" (1/1) ... [2019-12-28 03:40:42,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:40:42,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:40:43,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:40:43,094 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:40:43,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:40:43,256 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:40:43,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43 WrapperNode [2019-12-28 03:40:43,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:40:43,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:40:43,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:40:43,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:40:43,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43" (1/1) ... [2019-12-28 03:40:43,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43" (1/1) ... [2019-12-28 03:40:43,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:40:43,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:40:43,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:40:43,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:40:43,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43" (1/1) ... [2019-12-28 03:40:43,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43" (1/1) ... [2019-12-28 03:40:43,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43" (1/1) ... [2019-12-28 03:40:43,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43" (1/1) ... [2019-12-28 03:40:43,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43" (1/1) ... [2019-12-28 03:40:43,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43" (1/1) ... [2019-12-28 03:40:43,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43" (1/1) ... [2019-12-28 03:40:43,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:40:43,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:40:43,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:40:43,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:40:43,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43" (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 03:40:43,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:40:43,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:40:43,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:40:43,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:40:43,458 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:40:43,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:40:43,459 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:40:43,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:40:43,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:40:43,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:40:43,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:40:43,461 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 03:40:44,204 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:40:44,205 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:40:44,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:40:44 BoogieIcfgContainer [2019-12-28 03:40:44,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:40:44,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:40:44,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:40:44,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:40:44,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:40:42" (1/3) ... [2019-12-28 03:40:44,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43db7906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:40:44, skipping insertion in model container [2019-12-28 03:40:44,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:43" (2/3) ... [2019-12-28 03:40:44,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43db7906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:40:44, skipping insertion in model container [2019-12-28 03:40:44,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:40:44" (3/3) ... [2019-12-28 03:40:44,216 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.oepc.i [2019-12-28 03:40:44,228 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:40:44,228 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:40:44,236 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:40:44,237 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:40:44,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,282 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,282 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,283 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,283 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,283 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,292 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,293 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,345 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,345 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,354 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:44,375 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:40:44,396 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:40:44,397 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:40:44,397 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:40:44,397 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:40:44,397 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:40:44,397 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:40:44,397 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:40:44,397 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:40:44,414 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-28 03:40:46,449 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-12-28 03:40:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-12-28 03:40:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-28 03:40:46,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:46,459 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] [2019-12-28 03:40:46,459 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:40:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash -495638015, now seen corresponding path program 1 times [2019-12-28 03:40:46,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:46,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402327354] [2019-12-28 03:40:46,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:46,748 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 03:40:46,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402327354] [2019-12-28 03:40:46,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:46,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:40:46,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994426017] [2019-12-28 03:40:46,752 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:46,757 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:46,775 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 35 transitions. [2019-12-28 03:40:46,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:46,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:46,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:40:46,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:46,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:40:46,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:40:46,798 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-12-28 03:40:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:48,380 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-12-28 03:40:48,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:40:48,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-28 03:40:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:48,625 INFO L225 Difference]: With dead ends: 33592 [2019-12-28 03:40:48,625 INFO L226 Difference]: Without dead ends: 25704 [2019-12-28 03:40:48,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 03:40:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-12-28 03:40:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-12-28 03:40:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-12-28 03:40:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-12-28 03:40:50,197 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-12-28 03:40:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:50,198 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-12-28 03:40:50,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:40:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-12-28 03:40:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 03:40:50,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:50,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:40:50,206 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:40:50,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:50,207 INFO L82 PathProgramCache]: Analyzing trace with hash 857898703, now seen corresponding path program 1 times [2019-12-28 03:40:50,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:50,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808844910] [2019-12-28 03:40:50,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:50,337 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 03:40:50,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808844910] [2019-12-28 03:40:50,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:50,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:40:50,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811845194] [2019-12-28 03:40:50,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:50,343 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:50,352 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 03:40:50,353 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:50,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:50,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:40:50,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:50,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:40:50,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:40:50,355 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-12-28 03:40:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:51,263 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-12-28 03:40:51,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:40:51,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 03:40:51,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:52,722 INFO L225 Difference]: With dead ends: 41082 [2019-12-28 03:40:52,723 INFO L226 Difference]: Without dead ends: 40546 [2019-12-28 03:40:52,724 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 03:40:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-12-28 03:40:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-12-28 03:40:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-12-28 03:40:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-12-28 03:40:54,135 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-12-28 03:40:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:54,137 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-12-28 03:40:54,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:40:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-12-28 03:40:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 03:40:54,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:54,144 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] [2019-12-28 03:40:54,145 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:40:54,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:54,145 INFO L82 PathProgramCache]: Analyzing trace with hash -838391431, now seen corresponding path program 1 times [2019-12-28 03:40:54,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:54,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911010668] [2019-12-28 03:40:54,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:54,236 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 03:40:54,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911010668] [2019-12-28 03:40:54,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:54,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:40:54,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1743028402] [2019-12-28 03:40:54,237 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:54,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:54,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 03:40:54,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:54,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:54,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:40:54,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:54,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:40:54,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:40:54,251 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-12-28 03:40:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:55,154 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-12-28 03:40:55,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:40:55,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 03:40:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:55,391 INFO L225 Difference]: With dead ends: 49779 [2019-12-28 03:40:55,391 INFO L226 Difference]: Without dead ends: 49275 [2019-12-28 03:40:55,392 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 03:40:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-12-28 03:40:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-12-28 03:40:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-12-28 03:40:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-12-28 03:40:58,311 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-12-28 03:40:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:58,311 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-12-28 03:40:58,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:40:58,311 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-12-28 03:40:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 03:40:58,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:58,320 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 03:40:58,320 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:40:58,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:58,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1564050337, now seen corresponding path program 1 times [2019-12-28 03:40:58,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:58,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563121493] [2019-12-28 03:40:58,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:58,396 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 03:40:58,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563121493] [2019-12-28 03:40:58,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:58,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:40:58,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [723626715] [2019-12-28 03:40:58,399 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:58,404 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:58,409 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 50 transitions. [2019-12-28 03:40:58,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:58,410 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:58,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:40:58,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:58,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:40:58,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:40:58,411 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-12-28 03:40:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:59,233 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-12-28 03:40:59,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:40:59,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-28 03:40:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:59,414 INFO L225 Difference]: With dead ends: 61088 [2019-12-28 03:40:59,414 INFO L226 Difference]: Without dead ends: 61088 [2019-12-28 03:40:59,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:40:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-12-28 03:41:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-12-28 03:41:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-12-28 03:41:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-12-28 03:41:02,477 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-12-28 03:41:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:02,477 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-12-28 03:41:02,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:41:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-12-28 03:41:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:41:02,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:02,496 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] [2019-12-28 03:41:02,496 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:02,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:02,496 INFO L82 PathProgramCache]: Analyzing trace with hash -473523742, now seen corresponding path program 1 times [2019-12-28 03:41:02,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:02,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553941373] [2019-12-28 03:41:02,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:02,634 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 03:41:02,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553941373] [2019-12-28 03:41:02,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:02,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:02,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1753824322] [2019-12-28 03:41:02,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:02,641 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:02,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 66 transitions. [2019-12-28 03:41:02,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:02,651 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:02,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:02,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:02,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:02,653 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 6 states. [2019-12-28 03:41:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:03,740 INFO L93 Difference]: Finished difference Result 63757 states and 229380 transitions. [2019-12-28 03:41:03,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:41:03,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 03:41:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:03,902 INFO L225 Difference]: With dead ends: 63757 [2019-12-28 03:41:03,902 INFO L226 Difference]: Without dead ends: 63757 [2019-12-28 03:41:03,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 03:41:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63757 states. [2019-12-28 03:41:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63757 to 59950. [2019-12-28 03:41:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-12-28 03:41:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-12-28 03:41:07,970 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-12-28 03:41:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:07,970 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-12-28 03:41:07,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-12-28 03:41:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:41:07,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41: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] [2019-12-28 03:41:07,989 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:07,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:07,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2024492195, now seen corresponding path program 1 times [2019-12-28 03:41:07,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:07,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504290389] [2019-12-28 03:41:07,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:08,109 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 03:41:08,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504290389] [2019-12-28 03:41:08,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:08,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:41:08,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2024981212] [2019-12-28 03:41:08,110 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:08,116 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:08,122 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 66 transitions. [2019-12-28 03:41:08,123 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:08,123 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:08,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:41:08,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:08,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:41:08,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:41:08,125 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 3 states. [2019-12-28 03:41:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:08,382 INFO L93 Difference]: Finished difference Result 54022 states and 188919 transitions. [2019-12-28 03:41:08,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:41:08,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-28 03:41:08,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:08,486 INFO L225 Difference]: With dead ends: 54022 [2019-12-28 03:41:08,487 INFO L226 Difference]: Without dead ends: 54022 [2019-12-28 03:41:08,487 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 03:41:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54022 states. [2019-12-28 03:41:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54022 to 53407. [2019-12-28 03:41:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53407 states. [2019-12-28 03:41:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53407 states to 53407 states and 187038 transitions. [2019-12-28 03:41:09,745 INFO L78 Accepts]: Start accepts. Automaton has 53407 states and 187038 transitions. Word has length 54 [2019-12-28 03:41:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:09,746 INFO L462 AbstractCegarLoop]: Abstraction has 53407 states and 187038 transitions. [2019-12-28 03:41:09,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:41:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 53407 states and 187038 transitions. [2019-12-28 03:41:09,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:41:09,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:09,757 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] [2019-12-28 03:41:09,757 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:09,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:09,757 INFO L82 PathProgramCache]: Analyzing trace with hash 463621674, now seen corresponding path program 1 times [2019-12-28 03:41:09,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:09,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643525827] [2019-12-28 03:41:09,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:09,836 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 03:41:09,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643525827] [2019-12-28 03:41:09,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:09,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:09,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1018563238] [2019-12-28 03:41:09,838 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:09,845 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:09,852 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 54 transitions. [2019-12-28 03:41:09,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:09,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:09,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:09,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:09,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:09,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:09,854 INFO L87 Difference]: Start difference. First operand 53407 states and 187038 transitions. Second operand 6 states. [2019-12-28 03:41:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:10,704 INFO L93 Difference]: Finished difference Result 68647 states and 237302 transitions. [2019-12-28 03:41:10,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:41:10,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 03:41:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:10,886 INFO L225 Difference]: With dead ends: 68647 [2019-12-28 03:41:10,887 INFO L226 Difference]: Without dead ends: 68079 [2019-12-28 03:41:10,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:41:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68079 states. [2019-12-28 03:41:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68079 to 53491. [2019-12-28 03:41:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53491 states. [2019-12-28 03:41:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53491 states to 53491 states and 187735 transitions. [2019-12-28 03:41:12,530 INFO L78 Accepts]: Start accepts. Automaton has 53491 states and 187735 transitions. Word has length 54 [2019-12-28 03:41:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:12,531 INFO L462 AbstractCegarLoop]: Abstraction has 53491 states and 187735 transitions. [2019-12-28 03:41:12,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 53491 states and 187735 transitions. [2019-12-28 03:41:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:41:12,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:12,541 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] [2019-12-28 03:41:12,542 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:12,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash 68794998, now seen corresponding path program 1 times [2019-12-28 03:41:12,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:12,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280848069] [2019-12-28 03:41:12,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:12,645 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 03:41:12,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280848069] [2019-12-28 03:41:12,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:12,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:41:12,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1579146212] [2019-12-28 03:41:12,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:12,651 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:12,658 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 55 transitions. [2019-12-28 03:41:12,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:12,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:12,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:41:12,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:12,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:41:12,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:41:12,659 INFO L87 Difference]: Start difference. First operand 53491 states and 187735 transitions. Second operand 4 states. [2019-12-28 03:41:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:12,716 INFO L93 Difference]: Finished difference Result 10213 states and 31247 transitions. [2019-12-28 03:41:12,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:41:12,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-28 03:41:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:12,728 INFO L225 Difference]: With dead ends: 10213 [2019-12-28 03:41:12,728 INFO L226 Difference]: Without dead ends: 8508 [2019-12-28 03:41:12,728 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 03:41:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2019-12-28 03:41:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 8460. [2019-12-28 03:41:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-12-28 03:41:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 25326 transitions. [2019-12-28 03:41:12,829 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 25326 transitions. Word has length 55 [2019-12-28 03:41:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:12,829 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 25326 transitions. [2019-12-28 03:41:12,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:41:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 25326 transitions. [2019-12-28 03:41:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 03:41:12,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:12,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:12,833 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:12,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2084137189, now seen corresponding path program 1 times [2019-12-28 03:41:12,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:12,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135016998] [2019-12-28 03:41:12,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:12,913 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 03:41:12,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135016998] [2019-12-28 03:41:12,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:12,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:12,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2020731085] [2019-12-28 03:41:12,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:12,924 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:12,934 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 62 transitions. [2019-12-28 03:41:12,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:12,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:12,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:12,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:12,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:12,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:12,936 INFO L87 Difference]: Start difference. First operand 8460 states and 25326 transitions. Second operand 6 states. [2019-12-28 03:41:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:13,646 INFO L93 Difference]: Finished difference Result 10741 states and 31734 transitions. [2019-12-28 03:41:13,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:41:13,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-28 03:41:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:13,666 INFO L225 Difference]: With dead ends: 10741 [2019-12-28 03:41:13,666 INFO L226 Difference]: Without dead ends: 10680 [2019-12-28 03:41:13,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:41:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10680 states. [2019-12-28 03:41:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10680 to 9961. [2019-12-28 03:41:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9961 states. [2019-12-28 03:41:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9961 states to 9961 states and 29612 transitions. [2019-12-28 03:41:13,810 INFO L78 Accepts]: Start accepts. Automaton has 9961 states and 29612 transitions. Word has length 62 [2019-12-28 03:41:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:13,810 INFO L462 AbstractCegarLoop]: Abstraction has 9961 states and 29612 transitions. [2019-12-28 03:41:13,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9961 states and 29612 transitions. [2019-12-28 03:41:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:41:13,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:13,816 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] [2019-12-28 03:41:13,816 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:13,816 INFO L82 PathProgramCache]: Analyzing trace with hash -761882474, now seen corresponding path program 1 times [2019-12-28 03:41:13,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:13,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804323430] [2019-12-28 03:41:13,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:13,893 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 03:41:13,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804323430] [2019-12-28 03:41:13,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:13,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:41:13,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9116119] [2019-12-28 03:41:13,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:13,907 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:13,934 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 03:41:13,934 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:14,036 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 03:41:14,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:41:14,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:14,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:41:14,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:14,037 INFO L87 Difference]: Start difference. First operand 9961 states and 29612 transitions. Second operand 7 states. [2019-12-28 03:41:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:14,401 INFO L93 Difference]: Finished difference Result 12779 states and 37556 transitions. [2019-12-28 03:41:14,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:41:14,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-28 03:41:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:14,459 INFO L225 Difference]: With dead ends: 12779 [2019-12-28 03:41:14,459 INFO L226 Difference]: Without dead ends: 12779 [2019-12-28 03:41:14,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12779 states. [2019-12-28 03:41:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12779 to 11120. [2019-12-28 03:41:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11120 states. [2019-12-28 03:41:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11120 states to 11120 states and 32800 transitions. [2019-12-28 03:41:14,797 INFO L78 Accepts]: Start accepts. Automaton has 11120 states and 32800 transitions. Word has length 68 [2019-12-28 03:41:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:14,798 INFO L462 AbstractCegarLoop]: Abstraction has 11120 states and 32800 transitions. [2019-12-28 03:41:14,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:41:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 11120 states and 32800 transitions. [2019-12-28 03:41:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:41:14,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:14,811 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] [2019-12-28 03:41:14,811 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:14,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:14,812 INFO L82 PathProgramCache]: Analyzing trace with hash 482882007, now seen corresponding path program 1 times [2019-12-28 03:41:14,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:14,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138264594] [2019-12-28 03:41:14,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:14,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 03:41:14,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138264594] [2019-12-28 03:41:14,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:14,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:14,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1876714295] [2019-12-28 03:41:14,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:14,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:14,958 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 03:41:14,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:15,079 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 03:41:15,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:41:15,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:15,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:41:15,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:41:15,080 INFO L87 Difference]: Start difference. First operand 11120 states and 32800 transitions. Second operand 9 states. [2019-12-28 03:41:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:15,935 INFO L93 Difference]: Finished difference Result 12254 states and 35521 transitions. [2019-12-28 03:41:15,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:41:15,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-28 03:41:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:15,957 INFO L225 Difference]: With dead ends: 12254 [2019-12-28 03:41:15,958 INFO L226 Difference]: Without dead ends: 12254 [2019-12-28 03:41:15,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:41:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2019-12-28 03:41:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 11959. [2019-12-28 03:41:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11959 states. [2019-12-28 03:41:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11959 states to 11959 states and 34775 transitions. [2019-12-28 03:41:16,250 INFO L78 Accepts]: Start accepts. Automaton has 11959 states and 34775 transitions. Word has length 68 [2019-12-28 03:41:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:16,251 INFO L462 AbstractCegarLoop]: Abstraction has 11959 states and 34775 transitions. [2019-12-28 03:41:16,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:41:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 11959 states and 34775 transitions. [2019-12-28 03:41:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:41:16,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:16,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:41:16,267 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:16,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1594327336, now seen corresponding path program 1 times [2019-12-28 03:41:16,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:16,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783754887] [2019-12-28 03:41:16,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:16,394 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 03:41:16,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783754887] [2019-12-28 03:41:16,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:16,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:16,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374503707] [2019-12-28 03:41:16,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:16,406 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:16,429 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 03:41:16,429 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:16,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 03:41:16,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 03:41:16,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:16,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 03:41:16,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:41:16,660 INFO L87 Difference]: Start difference. First operand 11959 states and 34775 transitions. Second operand 10 states. [2019-12-28 03:41:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:17,334 INFO L93 Difference]: Finished difference Result 13808 states and 38964 transitions. [2019-12-28 03:41:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:41:17,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-12-28 03:41:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:17,359 INFO L225 Difference]: With dead ends: 13808 [2019-12-28 03:41:17,359 INFO L226 Difference]: Without dead ends: 13808 [2019-12-28 03:41:17,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:41:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13808 states. [2019-12-28 03:41:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13808 to 12522. [2019-12-28 03:41:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12522 states. [2019-12-28 03:41:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12522 states to 12522 states and 35774 transitions. [2019-12-28 03:41:17,578 INFO L78 Accepts]: Start accepts. Automaton has 12522 states and 35774 transitions. Word has length 68 [2019-12-28 03:41:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:17,579 INFO L462 AbstractCegarLoop]: Abstraction has 12522 states and 35774 transitions. [2019-12-28 03:41:17,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 03:41:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12522 states and 35774 transitions. [2019-12-28 03:41:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:41:17,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:17,589 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] [2019-12-28 03:41:17,590 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:17,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1382976423, now seen corresponding path program 1 times [2019-12-28 03:41:17,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:17,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455698387] [2019-12-28 03:41:17,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:17,678 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 03:41:17,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455698387] [2019-12-28 03:41:17,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:17,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:17,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1392573639] [2019-12-28 03:41:17,679 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:17,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:17,711 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 03:41:17,712 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:17,734 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:41:17,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:17,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:17,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:17,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:17,735 INFO L87 Difference]: Start difference. First operand 12522 states and 35774 transitions. Second operand 6 states. [2019-12-28 03:41:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:18,173 INFO L93 Difference]: Finished difference Result 16038 states and 45579 transitions. [2019-12-28 03:41:18,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:41:18,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 03:41:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:18,195 INFO L225 Difference]: With dead ends: 16038 [2019-12-28 03:41:18,196 INFO L226 Difference]: Without dead ends: 16038 [2019-12-28 03:41:18,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16038 states. [2019-12-28 03:41:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16038 to 14892. [2019-12-28 03:41:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14892 states. [2019-12-28 03:41:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14892 states to 14892 states and 42227 transitions. [2019-12-28 03:41:18,404 INFO L78 Accepts]: Start accepts. Automaton has 14892 states and 42227 transitions. Word has length 68 [2019-12-28 03:41:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:18,405 INFO L462 AbstractCegarLoop]: Abstraction has 14892 states and 42227 transitions. [2019-12-28 03:41:18,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 14892 states and 42227 transitions. [2019-12-28 03:41:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:41:18,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:18,414 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] [2019-12-28 03:41:18,414 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1893510600, now seen corresponding path program 1 times [2019-12-28 03:41:18,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:18,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089024688] [2019-12-28 03:41:18,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:18,476 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 03:41:18,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089024688] [2019-12-28 03:41:18,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:18,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:41:18,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1590612773] [2019-12-28 03:41:18,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:18,488 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:18,512 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 03:41:18,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:18,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:18,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:41:18,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:18,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:41:18,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:41:18,514 INFO L87 Difference]: Start difference. First operand 14892 states and 42227 transitions. Second operand 4 states. [2019-12-28 03:41:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:19,072 INFO L93 Difference]: Finished difference Result 18321 states and 52088 transitions. [2019-12-28 03:41:19,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:41:19,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-28 03:41:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:19,097 INFO L225 Difference]: With dead ends: 18321 [2019-12-28 03:41:19,097 INFO L226 Difference]: Without dead ends: 18144 [2019-12-28 03:41:19,098 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 03:41:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18144 states. [2019-12-28 03:41:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18144 to 17301. [2019-12-28 03:41:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17301 states. [2019-12-28 03:41:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17301 states to 17301 states and 49086 transitions. [2019-12-28 03:41:19,344 INFO L78 Accepts]: Start accepts. Automaton has 17301 states and 49086 transitions. Word has length 68 [2019-12-28 03:41:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:19,345 INFO L462 AbstractCegarLoop]: Abstraction has 17301 states and 49086 transitions. [2019-12-28 03:41:19,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:41:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 17301 states and 49086 transitions. [2019-12-28 03:41:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:41:19,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:19,355 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] [2019-12-28 03:41:19,355 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:19,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash 604505337, now seen corresponding path program 1 times [2019-12-28 03:41:19,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:19,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271647434] [2019-12-28 03:41:19,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:19,434 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 03:41:19,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271647434] [2019-12-28 03:41:19,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:19,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:19,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115126875] [2019-12-28 03:41:19,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:19,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:19,501 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 03:41:19,501 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:19,521 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:41:19,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:19,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:19,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:19,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:19,522 INFO L87 Difference]: Start difference. First operand 17301 states and 49086 transitions. Second operand 6 states. [2019-12-28 03:41:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:19,694 INFO L93 Difference]: Finished difference Result 5637 states and 13329 transitions. [2019-12-28 03:41:19,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:41:19,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 03:41:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:19,701 INFO L225 Difference]: With dead ends: 5637 [2019-12-28 03:41:19,701 INFO L226 Difference]: Without dead ends: 4851 [2019-12-28 03:41:19,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2019-12-28 03:41:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 4581. [2019-12-28 03:41:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4581 states. [2019-12-28 03:41:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 10496 transitions. [2019-12-28 03:41:19,778 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 10496 transitions. Word has length 68 [2019-12-28 03:41:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:19,779 INFO L462 AbstractCegarLoop]: Abstraction has 4581 states and 10496 transitions. [2019-12-28 03:41:19,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 10496 transitions. [2019-12-28 03:41:19,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:41:19,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:19,787 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] [2019-12-28 03:41:19,788 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:19,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:19,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1513751510, now seen corresponding path program 1 times [2019-12-28 03:41:19,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:19,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358292908] [2019-12-28 03:41:19,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:19,820 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 03:41:19,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358292908] [2019-12-28 03:41:19,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:19,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:41:19,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1776791926] [2019-12-28 03:41:19,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:19,834 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:19,849 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:41:19,849 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:19,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:19,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:41:19,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:19,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:41:19,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:41:19,851 INFO L87 Difference]: Start difference. First operand 4581 states and 10496 transitions. Second operand 3 states. [2019-12-28 03:41:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:19,887 INFO L93 Difference]: Finished difference Result 5732 states and 12928 transitions. [2019-12-28 03:41:19,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:41:19,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-28 03:41:19,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:19,894 INFO L225 Difference]: With dead ends: 5732 [2019-12-28 03:41:19,895 INFO L226 Difference]: Without dead ends: 5732 [2019-12-28 03:41:19,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:41:19,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5732 states. [2019-12-28 03:41:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5732 to 4541. [2019-12-28 03:41:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-12-28 03:41:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 10113 transitions. [2019-12-28 03:41:19,964 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 10113 transitions. Word has length 68 [2019-12-28 03:41:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:19,964 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 10113 transitions. [2019-12-28 03:41:19,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:41:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 10113 transitions. [2019-12-28 03:41:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-28 03:41:19,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:19,970 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] [2019-12-28 03:41:19,971 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:19,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash -696243832, now seen corresponding path program 1 times [2019-12-28 03:41:19,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:19,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529606412] [2019-12-28 03:41:19,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:20,035 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 03:41:20,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529606412] [2019-12-28 03:41:20,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:20,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:41:20,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [147626100] [2019-12-28 03:41:20,036 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:20,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:20,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 74 transitions. [2019-12-28 03:41:20,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:20,068 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:20,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:41:20,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:20,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:41:20,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:20,069 INFO L87 Difference]: Start difference. First operand 4541 states and 10113 transitions. Second operand 7 states. [2019-12-28 03:41:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:20,552 INFO L93 Difference]: Finished difference Result 5463 states and 12048 transitions. [2019-12-28 03:41:20,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:41:20,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-28 03:41:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:20,560 INFO L225 Difference]: With dead ends: 5463 [2019-12-28 03:41:20,560 INFO L226 Difference]: Without dead ends: 5410 [2019-12-28 03:41:20,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:41:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2019-12-28 03:41:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 4613. [2019-12-28 03:41:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4613 states. [2019-12-28 03:41:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 10165 transitions. [2019-12-28 03:41:20,614 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 10165 transitions. Word has length 74 [2019-12-28 03:41:20,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:20,615 INFO L462 AbstractCegarLoop]: Abstraction has 4613 states and 10165 transitions. [2019-12-28 03:41:20,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:41:20,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 10165 transitions. [2019-12-28 03:41:20,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:20,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:20,620 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] [2019-12-28 03:41:20,620 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:20,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1799739819, now seen corresponding path program 1 times [2019-12-28 03:41:20,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:20,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343554063] [2019-12-28 03:41:20,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:20,687 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 03:41:20,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343554063] [2019-12-28 03:41:20,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:20,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:20,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [937715585] [2019-12-28 03:41:20,688 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:20,711 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:20,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 233 transitions. [2019-12-28 03:41:20,806 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:20,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:41:20,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:20,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:20,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:20,944 INFO L87 Difference]: Start difference. First operand 4613 states and 10165 transitions. Second operand 8 states. [2019-12-28 03:41:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:22,750 INFO L93 Difference]: Finished difference Result 9635 states and 21579 transitions. [2019-12-28 03:41:22,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 03:41:22,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 03:41:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:22,762 INFO L225 Difference]: With dead ends: 9635 [2019-12-28 03:41:22,763 INFO L226 Difference]: Without dead ends: 9635 [2019-12-28 03:41:22,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:41:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9635 states. [2019-12-28 03:41:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9635 to 4745. [2019-12-28 03:41:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2019-12-28 03:41:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 10455 transitions. [2019-12-28 03:41:22,836 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 10455 transitions. Word has length 95 [2019-12-28 03:41:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:22,836 INFO L462 AbstractCegarLoop]: Abstraction has 4745 states and 10455 transitions. [2019-12-28 03:41:22,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 10455 transitions. [2019-12-28 03:41:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:22,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:22,841 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] [2019-12-28 03:41:22,841 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:22,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:22,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1523385151, now seen corresponding path program 2 times [2019-12-28 03:41:22,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:22,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126860277] [2019-12-28 03:41:22,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:22,901 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 03:41:22,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126860277] [2019-12-28 03:41:22,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:22,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:41:22,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [883778393] [2019-12-28 03:41:22,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:22,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:23,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 202 transitions. [2019-12-28 03:41:23,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:23,069 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:41:23,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:41:23,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:23,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:41:23,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:41:23,070 INFO L87 Difference]: Start difference. First operand 4745 states and 10455 transitions. Second operand 4 states. [2019-12-28 03:41:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:23,184 INFO L93 Difference]: Finished difference Result 5650 states and 12371 transitions. [2019-12-28 03:41:23,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:41:23,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-28 03:41:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:23,191 INFO L225 Difference]: With dead ends: 5650 [2019-12-28 03:41:23,191 INFO L226 Difference]: Without dead ends: 5650 [2019-12-28 03:41:23,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:41:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2019-12-28 03:41:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 4903. [2019-12-28 03:41:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4903 states. [2019-12-28 03:41:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4903 states to 4903 states and 10782 transitions. [2019-12-28 03:41:23,240 INFO L78 Accepts]: Start accepts. Automaton has 4903 states and 10782 transitions. Word has length 95 [2019-12-28 03:41:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:23,240 INFO L462 AbstractCegarLoop]: Abstraction has 4903 states and 10782 transitions. [2019-12-28 03:41:23,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:41:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4903 states and 10782 transitions. [2019-12-28 03:41:23,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:23,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:23,244 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 03:41:23,245 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:23,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:23,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1360927908, now seen corresponding path program 1 times [2019-12-28 03:41:23,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:23,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240764378] [2019-12-28 03:41:23,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:23,307 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 03:41:23,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240764378] [2019-12-28 03:41:23,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:23,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:41:23,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [217480211] [2019-12-28 03:41:23,308 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:23,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:23,424 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 239 transitions. [2019-12-28 03:41:23,424 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:23,426 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:41:23,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:41:23,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:23,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:41:23,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:41:23,427 INFO L87 Difference]: Start difference. First operand 4903 states and 10782 transitions. Second operand 4 states. [2019-12-28 03:41:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:23,525 INFO L93 Difference]: Finished difference Result 5334 states and 11749 transitions. [2019-12-28 03:41:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:41:23,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-28 03:41:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:23,533 INFO L225 Difference]: With dead ends: 5334 [2019-12-28 03:41:23,533 INFO L226 Difference]: Without dead ends: 5334 [2019-12-28 03:41:23,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 03:41:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5334 states. [2019-12-28 03:41:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5334 to 4974. [2019-12-28 03:41:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4974 states. [2019-12-28 03:41:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4974 states to 4974 states and 10933 transitions. [2019-12-28 03:41:23,580 INFO L78 Accepts]: Start accepts. Automaton has 4974 states and 10933 transitions. Word has length 97 [2019-12-28 03:41:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:23,580 INFO L462 AbstractCegarLoop]: Abstraction has 4974 states and 10933 transitions. [2019-12-28 03:41:23,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:41:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4974 states and 10933 transitions. [2019-12-28 03:41:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:23,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:23,584 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 03:41:23,585 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:23,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:23,585 INFO L82 PathProgramCache]: Analyzing trace with hash 626553852, now seen corresponding path program 1 times [2019-12-28 03:41:23,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:23,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248544758] [2019-12-28 03:41:23,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:23,774 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 03:41:23,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248544758] [2019-12-28 03:41:23,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:23,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:23,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [107589381] [2019-12-28 03:41:23,775 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:23,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:23,892 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 239 transitions. [2019-12-28 03:41:23,892 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:24,080 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-28 03:41:24,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:41:24,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:24,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:24,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:24,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:24,105 INFO L87 Difference]: Start difference. First operand 4974 states and 10933 transitions. Second operand 8 states. [2019-12-28 03:41:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:24,807 INFO L93 Difference]: Finished difference Result 6946 states and 15167 transitions. [2019-12-28 03:41:24,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:41:24,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-28 03:41:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:24,816 INFO L225 Difference]: With dead ends: 6946 [2019-12-28 03:41:24,817 INFO L226 Difference]: Without dead ends: 6946 [2019-12-28 03:41:24,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:41:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-12-28 03:41:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 4852. [2019-12-28 03:41:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4852 states. [2019-12-28 03:41:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 10710 transitions. [2019-12-28 03:41:24,875 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 10710 transitions. Word has length 97 [2019-12-28 03:41:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:24,875 INFO L462 AbstractCegarLoop]: Abstraction has 4852 states and 10710 transitions. [2019-12-28 03:41:24,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 10710 transitions. [2019-12-28 03:41:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:24,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:24,881 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 03:41:24,881 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash 956185055, now seen corresponding path program 1 times [2019-12-28 03:41:24,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:24,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593275] [2019-12-28 03:41:24,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:24,953 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 03:41:24,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593275] [2019-12-28 03:41:24,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:24,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:41:24,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1365326979] [2019-12-28 03:41:24,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:24,983 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:25,103 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 281 transitions. [2019-12-28 03:41:25,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:25,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:41:25,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:41:25,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:25,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:41:25,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:41:25,107 INFO L87 Difference]: Start difference. First operand 4852 states and 10710 transitions. Second operand 4 states. [2019-12-28 03:41:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:25,445 INFO L93 Difference]: Finished difference Result 6099 states and 13393 transitions. [2019-12-28 03:41:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:41:25,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-28 03:41:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:25,456 INFO L225 Difference]: With dead ends: 6099 [2019-12-28 03:41:25,457 INFO L226 Difference]: Without dead ends: 6047 [2019-12-28 03:41:25,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 03:41:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2019-12-28 03:41:25,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 5762. [2019-12-28 03:41:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5762 states. [2019-12-28 03:41:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5762 states to 5762 states and 12679 transitions. [2019-12-28 03:41:25,571 INFO L78 Accepts]: Start accepts. Automaton has 5762 states and 12679 transitions. Word has length 97 [2019-12-28 03:41:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:25,572 INFO L462 AbstractCegarLoop]: Abstraction has 5762 states and 12679 transitions. [2019-12-28 03:41:25,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:41:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5762 states and 12679 transitions. [2019-12-28 03:41:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:25,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:25,584 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 03:41:25,584 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1186461248, now seen corresponding path program 1 times [2019-12-28 03:41:25,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:25,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698131277] [2019-12-28 03:41:25,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:25,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698131277] [2019-12-28 03:41:25,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:25,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:41:25,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [40117904] [2019-12-28 03:41:25,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:25,819 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:25,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 281 transitions. [2019-12-28 03:41:25,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:25,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:41:25,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:41:25,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:25,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:41:25,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:25,938 INFO L87 Difference]: Start difference. First operand 5762 states and 12679 transitions. Second operand 7 states. [2019-12-28 03:41:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:26,470 INFO L93 Difference]: Finished difference Result 7224 states and 15874 transitions. [2019-12-28 03:41:26,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 03:41:26,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-28 03:41:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:26,480 INFO L225 Difference]: With dead ends: 7224 [2019-12-28 03:41:26,480 INFO L226 Difference]: Without dead ends: 7224 [2019-12-28 03:41:26,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-28 03:41:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-12-28 03:41:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 6629. [2019-12-28 03:41:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6629 states. [2019-12-28 03:41:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6629 states to 6629 states and 14622 transitions. [2019-12-28 03:41:26,551 INFO L78 Accepts]: Start accepts. Automaton has 6629 states and 14622 transitions. Word has length 97 [2019-12-28 03:41:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:26,551 INFO L462 AbstractCegarLoop]: Abstraction has 6629 states and 14622 transitions. [2019-12-28 03:41:26,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:41:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 6629 states and 14622 transitions. [2019-12-28 03:41:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:26,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:26,558 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 03:41:26,558 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:26,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1121024288, now seen corresponding path program 1 times [2019-12-28 03:41:26,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:26,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493190436] [2019-12-28 03:41:26,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:26,721 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 03:41:26,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493190436] [2019-12-28 03:41:26,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:26,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:41:26,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1844833282] [2019-12-28 03:41:26,722 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:26,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:26,847 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 281 transitions. [2019-12-28 03:41:26,847 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:27,136 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-28 03:41:27,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-28 03:41:27,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-28 03:41:27,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:27,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-28 03:41:27,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-12-28 03:41:27,198 INFO L87 Difference]: Start difference. First operand 6629 states and 14622 transitions. Second operand 15 states. [2019-12-28 03:41:30,421 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-12-28 03:41:30,644 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-28 03:41:32,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:32,262 INFO L93 Difference]: Finished difference Result 9151 states and 19879 transitions. [2019-12-28 03:41:32,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-28 03:41:32,262 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-12-28 03:41:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:32,272 INFO L225 Difference]: With dead ends: 9151 [2019-12-28 03:41:32,272 INFO L226 Difference]: Without dead ends: 9151 [2019-12-28 03:41:32,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=473, Invalid=2179, Unknown=0, NotChecked=0, Total=2652 [2019-12-28 03:41:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9151 states. [2019-12-28 03:41:32,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9151 to 6486. [2019-12-28 03:41:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6486 states. [2019-12-28 03:41:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6486 states to 6486 states and 14214 transitions. [2019-12-28 03:41:32,352 INFO L78 Accepts]: Start accepts. Automaton has 6486 states and 14214 transitions. Word has length 97 [2019-12-28 03:41:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:32,352 INFO L462 AbstractCegarLoop]: Abstraction has 6486 states and 14214 transitions. [2019-12-28 03:41:32,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-28 03:41:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 6486 states and 14214 transitions. [2019-12-28 03:41:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:32,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:32,359 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 03:41:32,359 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:32,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:32,359 INFO L82 PathProgramCache]: Analyzing trace with hash -909673375, now seen corresponding path program 1 times [2019-12-28 03:41:32,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:32,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398869842] [2019-12-28 03:41:32,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:32,526 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 03:41:32,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398869842] [2019-12-28 03:41:32,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:32,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 03:41:32,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [119949603] [2019-12-28 03:41:32,527 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:32,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:32,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 281 transitions. [2019-12-28 03:41:32,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:32,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-28 03:41:32,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-28 03:41:32,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-28 03:41:32,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:41:32,884 INFO L87 Difference]: Start difference. First operand 6486 states and 14214 transitions. Second operand 17 states. [2019-12-28 03:41:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:37,749 INFO L93 Difference]: Finished difference Result 24557 states and 54188 transitions. [2019-12-28 03:41:37,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-28 03:41:37,750 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 97 [2019-12-28 03:41:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:37,768 INFO L225 Difference]: With dead ends: 24557 [2019-12-28 03:41:37,768 INFO L226 Difference]: Without dead ends: 16303 [2019-12-28 03:41:37,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=283, Invalid=1697, Unknown=0, NotChecked=0, Total=1980 [2019-12-28 03:41:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16303 states. [2019-12-28 03:41:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16303 to 6299. [2019-12-28 03:41:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6299 states. [2019-12-28 03:41:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 13768 transitions. [2019-12-28 03:41:37,882 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 13768 transitions. Word has length 97 [2019-12-28 03:41:37,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:37,882 INFO L462 AbstractCegarLoop]: Abstraction has 6299 states and 13768 transitions. [2019-12-28 03:41:37,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-28 03:41:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 13768 transitions. [2019-12-28 03:41:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:37,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:37,891 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 03:41:37,891 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1579425151, now seen corresponding path program 2 times [2019-12-28 03:41:37,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:37,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185065849] [2019-12-28 03:41:37,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:41:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:41:38,046 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:41:38,046 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:41:38,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:41:38 BasicIcfg [2019-12-28 03:41:38,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:41:38,263 INFO L168 Benchmark]: Toolchain (without parser) took 55883.01 ms. Allocated memory was 145.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 100.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 708.4 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:38,263 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-28 03:41:38,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 874.79 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 100.6 MB in the beginning and 158.9 MB in the end (delta: -58.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:38,264 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.54 ms. Allocated memory is still 205.0 MB. Free memory was 158.9 MB in the beginning and 156.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:38,265 INFO L168 Benchmark]: Boogie Preprocessor took 68.16 ms. Allocated memory is still 205.0 MB. Free memory was 156.2 MB in the beginning and 154.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:38,265 INFO L168 Benchmark]: RCFGBuilder took 814.51 ms. Allocated memory is still 205.0 MB. Free memory was 154.2 MB in the beginning and 110.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:38,266 INFO L168 Benchmark]: TraceAbstraction took 54053.03 ms. Allocated memory was 205.0 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 109.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 657.8 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:38,271 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.13 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 874.79 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 100.6 MB in the beginning and 158.9 MB in the end (delta: -58.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.54 ms. Allocated memory is still 205.0 MB. Free memory was 158.9 MB in the beginning and 156.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.16 ms. Allocated memory is still 205.0 MB. Free memory was 156.2 MB in the beginning and 154.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 814.51 ms. Allocated memory is still 205.0 MB. Free memory was 154.2 MB in the beginning and 110.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54053.03 ms. Allocated memory was 205.0 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 109.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 657.8 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: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L801] 0 pthread_t t1609; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1609, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L803] 0 pthread_t t1610; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1610, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L731] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L732] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L733] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L734] 1 x$r_buff0_thd1 = (_Bool)1 [L737] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L772] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L773] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L775] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L775] 2 x = x$flush_delayed ? x$mem_tmp : x [L776] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L814] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L817] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 53.6s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7474 SDtfs, 9488 SDslu, 21283 SDs, 0 SdLazy, 12151 SolverSat, 523 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 146 SyntacticMatches, 23 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59950occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 70192 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1878 NumberOfCodeBlocks, 1878 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1756 ConstructedInterpolants, 0 QuantifiedInterpolants, 289158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...