/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/safe034_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 05:28:43,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 05:28:43,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 05:28:43,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 05:28:43,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 05:28:43,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 05:28:43,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 05:28:43,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 05:28:43,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 05:28:43,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 05:28:43,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 05:28:43,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 05:28:43,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 05:28:43,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 05:28:43,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 05:28:43,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 05:28:43,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 05:28:43,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 05:28:43,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 05:28:43,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 05:28:43,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 05:28:43,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 05:28:43,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 05:28:43,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 05:28:43,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 05:28:43,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 05:28:43,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 05:28:43,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 05:28:43,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 05:28:43,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 05:28:43,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 05:28:43,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 05:28:43,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 05:28:43,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 05:28:43,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 05:28:43,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 05:28:43,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 05:28:43,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 05:28:43,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 05:28:43,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 05:28:43,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 05:28:43,428 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 05:28:43,442 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 05:28:43,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 05:28:43,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 05:28:43,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 05:28:43,444 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 05:28:43,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 05:28:43,445 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 05:28:43,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 05:28:43,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 05:28:43,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 05:28:43,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 05:28:43,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 05:28:43,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 05:28:43,446 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 05:28:43,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 05:28:43,446 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 05:28:43,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 05:28:43,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 05:28:43,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 05:28:43,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 05:28:43,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 05:28:43,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 05:28:43,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 05:28:43,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 05:28:43,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 05:28:43,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 05:28:43,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 05:28:43,449 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 05:28:43,449 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 05:28:43,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 05:28:43,449 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 05:28:43,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 05:28:43,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 05:28:43,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 05:28:43,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 05:28:43,745 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 05:28:43,745 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 05:28:43,746 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_rmo.oepc.i [2019-12-28 05:28:43,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae22ccd0f/f86d53be11b24474b26532118022dce9/FLAGe392640c1 [2019-12-28 05:28:44,390 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 05:28:44,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_rmo.oepc.i [2019-12-28 05:28:44,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae22ccd0f/f86d53be11b24474b26532118022dce9/FLAGe392640c1 [2019-12-28 05:28:44,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae22ccd0f/f86d53be11b24474b26532118022dce9 [2019-12-28 05:28:44,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 05:28:44,655 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 05:28:44,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 05:28:44,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 05:28:44,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 05:28:44,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:28:44" (1/1) ... [2019-12-28 05:28:44,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b036ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:44, skipping insertion in model container [2019-12-28 05:28:44,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:28:44" (1/1) ... [2019-12-28 05:28:44,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 05:28:44,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 05:28:45,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:28:45,331 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 05:28:45,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:28:45,474 INFO L208 MainTranslator]: Completed translation [2019-12-28 05:28:45,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45 WrapperNode [2019-12-28 05:28:45,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 05:28:45,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 05:28:45,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 05:28:45,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 05:28:45,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45" (1/1) ... [2019-12-28 05:28:45,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45" (1/1) ... [2019-12-28 05:28:45,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 05:28:45,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 05:28:45,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 05:28:45,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 05:28:45,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45" (1/1) ... [2019-12-28 05:28:45,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45" (1/1) ... [2019-12-28 05:28:45,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45" (1/1) ... [2019-12-28 05:28:45,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45" (1/1) ... [2019-12-28 05:28:45,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45" (1/1) ... [2019-12-28 05:28:45,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45" (1/1) ... [2019-12-28 05:28:45,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45" (1/1) ... [2019-12-28 05:28:45,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 05:28:45,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 05:28:45,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 05:28:45,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 05:28:45,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45" (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 05:28:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 05:28:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 05:28:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 05:28:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 05:28:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 05:28:45,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 05:28:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 05:28:45,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 05:28:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-28 05:28:45,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-28 05:28:45,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 05:28:45,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 05:28:45,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 05:28:45,656 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 05:28:46,390 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 05:28:46,390 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 05:28:46,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:28:46 BoogieIcfgContainer [2019-12-28 05:28:46,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 05:28:46,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 05:28:46,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 05:28:46,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 05:28:46,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:28:44" (1/3) ... [2019-12-28 05:28:46,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b5ad87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:28:46, skipping insertion in model container [2019-12-28 05:28:46,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:45" (2/3) ... [2019-12-28 05:28:46,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b5ad87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:28:46, skipping insertion in model container [2019-12-28 05:28:46,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:28:46" (3/3) ... [2019-12-28 05:28:46,401 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_rmo.oepc.i [2019-12-28 05:28:46,411 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 05:28:46,412 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 05:28:46,420 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 05:28:46,421 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 05:28:46,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,463 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,487 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,487 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,488 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,488 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,488 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,505 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,513 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,513 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,514 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:46,531 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-28 05:28:46,570 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 05:28:46,570 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 05:28:46,571 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 05:28:46,571 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 05:28:46,571 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 05:28:46,571 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 05:28:46,571 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 05:28:46,571 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 05:28:46,591 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 176 transitions [2019-12-28 05:29:06,020 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111186 states. [2019-12-28 05:29:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 111186 states. [2019-12-28 05:29:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 05:29:06,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:06,038 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] [2019-12-28 05:29:06,039 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:06,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:06,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1109224519, now seen corresponding path program 1 times [2019-12-28 05:29:06,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:06,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708822478] [2019-12-28 05:29:06,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:06,405 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 05:29:06,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708822478] [2019-12-28 05:29:06,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:06,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:29:06,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [767780841] [2019-12-28 05:29:06,409 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:06,419 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:06,443 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 45 transitions. [2019-12-28 05:29:06,444 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:06,448 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:29:06,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:29:06,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:06,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:29:06,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:29:06,463 INFO L87 Difference]: Start difference. First operand 111186 states. Second operand 4 states. [2019-12-28 05:29:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:07,826 INFO L93 Difference]: Finished difference Result 114114 states and 522350 transitions. [2019-12-28 05:29:07,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:29:07,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-28 05:29:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:08,363 INFO L225 Difference]: With dead ends: 114114 [2019-12-28 05:29:08,364 INFO L226 Difference]: Without dead ends: 82834 [2019-12-28 05:29:08,365 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 05:29:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82834 states. [2019-12-28 05:29:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82834 to 82834. [2019-12-28 05:29:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82834 states. [2019-12-28 05:29:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82834 states to 82834 states and 380410 transitions. [2019-12-28 05:29:15,752 INFO L78 Accepts]: Start accepts. Automaton has 82834 states and 380410 transitions. Word has length 45 [2019-12-28 05:29:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:15,759 INFO L462 AbstractCegarLoop]: Abstraction has 82834 states and 380410 transitions. [2019-12-28 05:29:15,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:29:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 82834 states and 380410 transitions. [2019-12-28 05:29:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 05:29:15,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:15,779 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] [2019-12-28 05:29:15,779 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:15,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:15,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1958045590, now seen corresponding path program 1 times [2019-12-28 05:29:15,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:15,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144961483] [2019-12-28 05:29:15,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:19,025 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 05:29:19,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144961483] [2019-12-28 05:29:19,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:19,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:29:19,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1005676034] [2019-12-28 05:29:19,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:19,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:19,043 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 05:29:19,043 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:19,044 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:29:19,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:29:19,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:29:19,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:29:19,046 INFO L87 Difference]: Start difference. First operand 82834 states and 380410 transitions. Second operand 5 states. [2019-12-28 05:29:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:20,480 INFO L93 Difference]: Finished difference Result 129234 states and 566702 transitions. [2019-12-28 05:29:20,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:29:20,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-28 05:29:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:21,735 INFO L225 Difference]: With dead ends: 129234 [2019-12-28 05:29:21,736 INFO L226 Difference]: Without dead ends: 126474 [2019-12-28 05:29:21,737 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 05:29:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126474 states. [2019-12-28 05:29:25,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126474 to 119958. [2019-12-28 05:29:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119958 states. [2019-12-28 05:29:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119958 states to 119958 states and 531549 transitions. [2019-12-28 05:29:26,028 INFO L78 Accepts]: Start accepts. Automaton has 119958 states and 531549 transitions. Word has length 53 [2019-12-28 05:29:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:26,029 INFO L462 AbstractCegarLoop]: Abstraction has 119958 states and 531549 transitions. [2019-12-28 05:29:26,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:29:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 119958 states and 531549 transitions. [2019-12-28 05:29:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 05:29:26,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:26,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:29:26,047 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash 690713249, now seen corresponding path program 1 times [2019-12-28 05:29:26,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:26,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683601140] [2019-12-28 05:29:26,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:26,138 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 05:29:26,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683601140] [2019-12-28 05:29:26,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:26,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:29:26,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [633986823] [2019-12-28 05:29:26,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:26,146 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:26,159 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 126 transitions. [2019-12-28 05:29:26,159 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:26,217 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 05:29:26,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:29:26,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:26,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:29:26,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:29:26,218 INFO L87 Difference]: Start difference. First operand 119958 states and 531549 transitions. Second operand 6 states. [2019-12-28 05:29:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:32,349 INFO L93 Difference]: Finished difference Result 156370 states and 680698 transitions. [2019-12-28 05:29:32,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:29:32,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 05:29:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:33,040 INFO L225 Difference]: With dead ends: 156370 [2019-12-28 05:29:33,040 INFO L226 Difference]: Without dead ends: 154130 [2019-12-28 05:29:33,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 05:29:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154130 states. [2019-12-28 05:29:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154130 to 132942. [2019-12-28 05:29:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132942 states. [2019-12-28 05:29:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132942 states to 132942 states and 585323 transitions. [2019-12-28 05:29:41,528 INFO L78 Accepts]: Start accepts. Automaton has 132942 states and 585323 transitions. Word has length 54 [2019-12-28 05:29:41,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:41,529 INFO L462 AbstractCegarLoop]: Abstraction has 132942 states and 585323 transitions. [2019-12-28 05:29:41,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:29:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 132942 states and 585323 transitions. [2019-12-28 05:29:41,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 05:29:41,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:41,557 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] [2019-12-28 05:29:41,558 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:41,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:41,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1060971801, now seen corresponding path program 1 times [2019-12-28 05:29:41,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:41,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406958982] [2019-12-28 05:29:41,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:41,618 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 05:29:41,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406958982] [2019-12-28 05:29:41,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:41,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:29:41,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1386928801] [2019-12-28 05:29:41,619 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:41,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:41,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 144 transitions. [2019-12-28 05:29:41,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:41,676 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 05:29:41,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:29:41,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:41,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:29:41,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:29:41,678 INFO L87 Difference]: Start difference. First operand 132942 states and 585323 transitions. Second operand 5 states. [2019-12-28 05:29:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:43,791 INFO L93 Difference]: Finished difference Result 171274 states and 741340 transitions. [2019-12-28 05:29:43,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:29:43,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-28 05:29:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:44,331 INFO L225 Difference]: With dead ends: 171274 [2019-12-28 05:29:44,331 INFO L226 Difference]: Without dead ends: 171274 [2019-12-28 05:29:44,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:29:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171274 states. [2019-12-28 05:29:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171274 to 151998. [2019-12-28 05:29:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151998 states. [2019-12-28 05:29:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151998 states to 151998 states and 663351 transitions. [2019-12-28 05:29:55,418 INFO L78 Accepts]: Start accepts. Automaton has 151998 states and 663351 transitions. Word has length 56 [2019-12-28 05:29:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:55,419 INFO L462 AbstractCegarLoop]: Abstraction has 151998 states and 663351 transitions. [2019-12-28 05:29:55,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:29:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 151998 states and 663351 transitions. [2019-12-28 05:29:55,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:29:55,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:55,463 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] [2019-12-28 05:29:55,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:55,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:55,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1957923899, now seen corresponding path program 1 times [2019-12-28 05:29:55,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:55,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076267900] [2019-12-28 05:29:55,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:55,599 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 05:29:55,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076267900] [2019-12-28 05:29:55,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:55,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:29:55,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2066950469] [2019-12-28 05:29:55,601 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:55,608 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:55,620 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 05:29:55,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:55,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:29:55,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:29:55,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:55,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:29:55,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:29:55,623 INFO L87 Difference]: Start difference. First operand 151998 states and 663351 transitions. Second operand 6 states. [2019-12-28 05:29:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:58,707 INFO L93 Difference]: Finished difference Result 208582 states and 902701 transitions. [2019-12-28 05:29:58,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:29:58,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-28 05:29:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:59,391 INFO L225 Difference]: With dead ends: 208582 [2019-12-28 05:29:59,391 INFO L226 Difference]: Without dead ends: 205382 [2019-12-28 05:29:59,392 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 05:30:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205382 states. [2019-12-28 05:30:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205382 to 193070. [2019-12-28 05:30:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193070 states. [2019-12-28 05:30:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193070 states to 193070 states and 837871 transitions. [2019-12-28 05:30:13,275 INFO L78 Accepts]: Start accepts. Automaton has 193070 states and 837871 transitions. Word has length 60 [2019-12-28 05:30:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:13,275 INFO L462 AbstractCegarLoop]: Abstraction has 193070 states and 837871 transitions. [2019-12-28 05:30:13,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:30:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 193070 states and 837871 transitions. [2019-12-28 05:30:13,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:30:13,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:13,330 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] [2019-12-28 05:30:13,330 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:13,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:13,330 INFO L82 PathProgramCache]: Analyzing trace with hash 540092038, now seen corresponding path program 1 times [2019-12-28 05:30:13,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:13,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987153451] [2019-12-28 05:30:13,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:13,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987153451] [2019-12-28 05:30:13,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:13,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:30:13,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [134233251] [2019-12-28 05:30:13,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:13,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:13,520 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 05:30:13,520 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:13,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:30:13,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:30:13,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:13,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:30:13,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:30:13,523 INFO L87 Difference]: Start difference. First operand 193070 states and 837871 transitions. Second operand 7 states. [2019-12-28 05:30:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:22,930 INFO L93 Difference]: Finished difference Result 275526 states and 1157813 transitions. [2019-12-28 05:30:22,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:30:22,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-28 05:30:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:23,855 INFO L225 Difference]: With dead ends: 275526 [2019-12-28 05:30:23,855 INFO L226 Difference]: Without dead ends: 275526 [2019-12-28 05:30:23,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:30:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275526 states. [2019-12-28 05:30:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275526 to 228422. [2019-12-28 05:30:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228422 states. [2019-12-28 05:30:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228422 states to 228422 states and 972797 transitions. [2019-12-28 05:30:32,384 INFO L78 Accepts]: Start accepts. Automaton has 228422 states and 972797 transitions. Word has length 60 [2019-12-28 05:30:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:32,385 INFO L462 AbstractCegarLoop]: Abstraction has 228422 states and 972797 transitions. [2019-12-28 05:30:32,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:30:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 228422 states and 972797 transitions. [2019-12-28 05:30:32,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:30:32,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:32,434 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] [2019-12-28 05:30:32,434 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:32,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:32,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1427595719, now seen corresponding path program 1 times [2019-12-28 05:30:32,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:32,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708343406] [2019-12-28 05:30:32,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:32,510 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 05:30:32,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708343406] [2019-12-28 05:30:32,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:32,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:30:32,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1850259014] [2019-12-28 05:30:32,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:32,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:32,525 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 05:30:32,526 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:32,530 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 05:30:32,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:30:32,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:32,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:30:32,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:30:32,531 INFO L87 Difference]: Start difference. First operand 228422 states and 972797 transitions. Second operand 4 states. [2019-12-28 05:30:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:40,325 INFO L93 Difference]: Finished difference Result 185894 states and 771106 transitions. [2019-12-28 05:30:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:30:40,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-28 05:30:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:40,879 INFO L225 Difference]: With dead ends: 185894 [2019-12-28 05:30:40,879 INFO L226 Difference]: Without dead ends: 180910 [2019-12-28 05:30:40,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 05:30:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180910 states. [2019-12-28 05:30:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180910 to 180910. [2019-12-28 05:30:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180910 states. [2019-12-28 05:30:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180910 states to 180910 states and 753597 transitions. [2019-12-28 05:30:46,635 INFO L78 Accepts]: Start accepts. Automaton has 180910 states and 753597 transitions. Word has length 60 [2019-12-28 05:30:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:46,635 INFO L462 AbstractCegarLoop]: Abstraction has 180910 states and 753597 transitions. [2019-12-28 05:30:46,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:30:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 180910 states and 753597 transitions. [2019-12-28 05:30:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:30:46,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:46,666 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] [2019-12-28 05:30:46,666 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:46,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1792364402, now seen corresponding path program 1 times [2019-12-28 05:30:46,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:46,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011854170] [2019-12-28 05:30:46,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:46,743 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 05:30:46,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011854170] [2019-12-28 05:30:46,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:46,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:30:46,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1826762987] [2019-12-28 05:30:46,744 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:46,752 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:46,772 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 180 transitions. [2019-12-28 05:30:46,772 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:46,826 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 05:30:46,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 05:30:46,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:46,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 05:30:46,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:30:46,827 INFO L87 Difference]: Start difference. First operand 180910 states and 753597 transitions. Second operand 8 states. [2019-12-28 05:30:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:53,957 INFO L93 Difference]: Finished difference Result 234266 states and 959370 transitions. [2019-12-28 05:30:53,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 05:30:53,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-28 05:30:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:54,682 INFO L225 Difference]: With dead ends: 234266 [2019-12-28 05:30:54,682 INFO L226 Difference]: Without dead ends: 229388 [2019-12-28 05:30:54,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 05:30:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229388 states. [2019-12-28 05:31:04,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229388 to 183769. [2019-12-28 05:31:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183769 states. [2019-12-28 05:31:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183769 states to 183769 states and 765836 transitions. [2019-12-28 05:31:06,346 INFO L78 Accepts]: Start accepts. Automaton has 183769 states and 765836 transitions. Word has length 60 [2019-12-28 05:31:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:06,346 INFO L462 AbstractCegarLoop]: Abstraction has 183769 states and 765836 transitions. [2019-12-28 05:31:06,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 05:31:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 183769 states and 765836 transitions. [2019-12-28 05:31:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 05:31:06,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:06,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:31:06,387 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:06,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:06,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2025804751, now seen corresponding path program 1 times [2019-12-28 05:31:06,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:06,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741428208] [2019-12-28 05:31:06,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:06,498 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 05:31:06,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741428208] [2019-12-28 05:31:06,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:06,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:31:06,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1100199026] [2019-12-28 05:31:06,500 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:06,507 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:06,517 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 83 transitions. [2019-12-28 05:31:06,517 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:06,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 05:31:06,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:31:06,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:06,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:31:06,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:31:06,538 INFO L87 Difference]: Start difference. First operand 183769 states and 765836 transitions. Second operand 6 states. [2019-12-28 05:31:06,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:06,753 INFO L93 Difference]: Finished difference Result 34882 states and 130106 transitions. [2019-12-28 05:31:06,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 05:31:06,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-28 05:31:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:06,817 INFO L225 Difference]: With dead ends: 34882 [2019-12-28 05:31:06,817 INFO L226 Difference]: Without dead ends: 30055 [2019-12-28 05:31:06,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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 05:31:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30055 states. [2019-12-28 05:31:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30055 to 29863. [2019-12-28 05:31:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29863 states. [2019-12-28 05:31:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29863 states to 29863 states and 110396 transitions. [2019-12-28 05:31:07,332 INFO L78 Accepts]: Start accepts. Automaton has 29863 states and 110396 transitions. Word has length 61 [2019-12-28 05:31:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:07,333 INFO L462 AbstractCegarLoop]: Abstraction has 29863 states and 110396 transitions. [2019-12-28 05:31:07,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:31:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 29863 states and 110396 transitions. [2019-12-28 05:31:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 05:31:07,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:07,350 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] [2019-12-28 05:31:07,350 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:07,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:07,350 INFO L82 PathProgramCache]: Analyzing trace with hash -565208698, now seen corresponding path program 1 times [2019-12-28 05:31:07,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:07,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421465763] [2019-12-28 05:31:07,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:07,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 05:31:07,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421465763] [2019-12-28 05:31:07,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:07,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:31:07,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [348402959] [2019-12-28 05:31:07,436 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:07,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:07,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 223 transitions. [2019-12-28 05:31:07,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:07,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 05:31:07,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:31:07,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:07,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:31:07,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:31:07,503 INFO L87 Difference]: Start difference. First operand 29863 states and 110396 transitions. Second operand 5 states. [2019-12-28 05:31:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:10,073 INFO L93 Difference]: Finished difference Result 34924 states and 128758 transitions. [2019-12-28 05:31:10,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:31:10,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 05:31:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:10,150 INFO L225 Difference]: With dead ends: 34924 [2019-12-28 05:31:10,150 INFO L226 Difference]: Without dead ends: 34924 [2019-12-28 05:31:10,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:31:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34924 states. [2019-12-28 05:31:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34924 to 31801. [2019-12-28 05:31:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31801 states. [2019-12-28 05:31:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31801 states to 31801 states and 117322 transitions. [2019-12-28 05:31:10,669 INFO L78 Accepts]: Start accepts. Automaton has 31801 states and 117322 transitions. Word has length 71 [2019-12-28 05:31:10,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:10,669 INFO L462 AbstractCegarLoop]: Abstraction has 31801 states and 117322 transitions. [2019-12-28 05:31:10,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:31:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 31801 states and 117322 transitions. [2019-12-28 05:31:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 05:31:10,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:10,685 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] [2019-12-28 05:31:10,685 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:10,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1177601637, now seen corresponding path program 1 times [2019-12-28 05:31:10,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:10,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726284087] [2019-12-28 05:31:10,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:10,771 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 05:31:10,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726284087] [2019-12-28 05:31:10,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:10,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:31:10,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [384350058] [2019-12-28 05:31:10,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:10,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:10,825 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 223 transitions. [2019-12-28 05:31:10,825 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:10,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 05:31:10,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:31:10,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:10,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:31:10,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:31:10,848 INFO L87 Difference]: Start difference. First operand 31801 states and 117322 transitions. Second operand 7 states. [2019-12-28 05:31:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:11,542 INFO L93 Difference]: Finished difference Result 40977 states and 149241 transitions. [2019-12-28 05:31:11,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 05:31:11,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-28 05:31:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:11,622 INFO L225 Difference]: With dead ends: 40977 [2019-12-28 05:31:11,622 INFO L226 Difference]: Without dead ends: 40797 [2019-12-28 05:31:11,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-28 05:31:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40797 states. [2019-12-28 05:31:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40797 to 34292. [2019-12-28 05:31:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34292 states. [2019-12-28 05:31:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34292 states to 34292 states and 125836 transitions. [2019-12-28 05:31:12,554 INFO L78 Accepts]: Start accepts. Automaton has 34292 states and 125836 transitions. Word has length 71 [2019-12-28 05:31:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:12,554 INFO L462 AbstractCegarLoop]: Abstraction has 34292 states and 125836 transitions. [2019-12-28 05:31:12,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:31:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 34292 states and 125836 transitions. [2019-12-28 05:31:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 05:31:12,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:12,575 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] [2019-12-28 05:31:12,576 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:12,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1556409345, now seen corresponding path program 1 times [2019-12-28 05:31:12,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:12,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003362661] [2019-12-28 05:31:12,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:12,631 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 05:31:12,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003362661] [2019-12-28 05:31:12,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:12,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:31:12,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1151528248] [2019-12-28 05:31:12,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:12,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:12,668 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 103 transitions. [2019-12-28 05:31:12,668 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:12,669 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:31:12,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:31:12,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:12,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:31:12,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:31:12,670 INFO L87 Difference]: Start difference. First operand 34292 states and 125836 transitions. Second operand 4 states. [2019-12-28 05:31:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:13,117 INFO L93 Difference]: Finished difference Result 43210 states and 156685 transitions. [2019-12-28 05:31:13,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:31:13,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-28 05:31:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:13,207 INFO L225 Difference]: With dead ends: 43210 [2019-12-28 05:31:13,207 INFO L226 Difference]: Without dead ends: 43210 [2019-12-28 05:31:13,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:31:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43210 states. [2019-12-28 05:31:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43210 to 39520. [2019-12-28 05:31:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39520 states. [2019-12-28 05:31:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39520 states to 39520 states and 143617 transitions. [2019-12-28 05:31:14,253 INFO L78 Accepts]: Start accepts. Automaton has 39520 states and 143617 transitions. Word has length 73 [2019-12-28 05:31:14,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:14,253 INFO L462 AbstractCegarLoop]: Abstraction has 39520 states and 143617 transitions. [2019-12-28 05:31:14,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:31:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 39520 states and 143617 transitions. [2019-12-28 05:31:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 05:31:14,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:14,281 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] [2019-12-28 05:31:14,281 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:14,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:14,282 INFO L82 PathProgramCache]: Analyzing trace with hash -520799998, now seen corresponding path program 1 times [2019-12-28 05:31:14,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:14,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689414207] [2019-12-28 05:31:14,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:14,339 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 05:31:14,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689414207] [2019-12-28 05:31:14,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:14,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:31:14,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [452560696] [2019-12-28 05:31:14,341 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:14,373 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:14,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 103 transitions. [2019-12-28 05:31:14,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:14,404 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:31:14,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 05:31:14,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:14,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 05:31:14,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:31:14,405 INFO L87 Difference]: Start difference. First operand 39520 states and 143617 transitions. Second operand 3 states. [2019-12-28 05:31:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:14,731 INFO L93 Difference]: Finished difference Result 41333 states and 149658 transitions. [2019-12-28 05:31:14,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:31:14,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-28 05:31:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:14,817 INFO L225 Difference]: With dead ends: 41333 [2019-12-28 05:31:14,817 INFO L226 Difference]: Without dead ends: 41333 [2019-12-28 05:31:14,817 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 05:31:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41333 states. [2019-12-28 05:31:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41333 to 40522. [2019-12-28 05:31:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40522 states. [2019-12-28 05:31:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40522 states to 40522 states and 146939 transitions. [2019-12-28 05:31:16,046 INFO L78 Accepts]: Start accepts. Automaton has 40522 states and 146939 transitions. Word has length 73 [2019-12-28 05:31:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:16,047 INFO L462 AbstractCegarLoop]: Abstraction has 40522 states and 146939 transitions. [2019-12-28 05:31:16,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 05:31:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 40522 states and 146939 transitions. [2019-12-28 05:31:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:31:16,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:16,079 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] [2019-12-28 05:31:16,080 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:16,080 INFO L82 PathProgramCache]: Analyzing trace with hash 239718800, now seen corresponding path program 1 times [2019-12-28 05:31:16,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:16,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321933565] [2019-12-28 05:31:16,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:16,173 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 05:31:16,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321933565] [2019-12-28 05:31:16,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:16,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:31:16,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [531770394] [2019-12-28 05:31:16,174 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:16,188 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:16,211 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:31:16,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:16,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:31:16,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:31:16,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:16,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:31:16,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:31:16,214 INFO L87 Difference]: Start difference. First operand 40522 states and 146939 transitions. Second operand 6 states. [2019-12-28 05:31:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:16,865 INFO L93 Difference]: Finished difference Result 45111 states and 161731 transitions. [2019-12-28 05:31:16,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:31:16,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-28 05:31:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:16,956 INFO L225 Difference]: With dead ends: 45111 [2019-12-28 05:31:16,956 INFO L226 Difference]: Without dead ends: 45111 [2019-12-28 05:31:16,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:31:17,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45111 states. [2019-12-28 05:31:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45111 to 43398. [2019-12-28 05:31:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43398 states. [2019-12-28 05:31:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43398 states to 43398 states and 156062 transitions. [2019-12-28 05:31:17,691 INFO L78 Accepts]: Start accepts. Automaton has 43398 states and 156062 transitions. Word has length 75 [2019-12-28 05:31:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:17,691 INFO L462 AbstractCegarLoop]: Abstraction has 43398 states and 156062 transitions. [2019-12-28 05:31:17,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:31:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 43398 states and 156062 transitions. [2019-12-28 05:31:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:31:17,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:17,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:31:17,728 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:17,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:17,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1837490543, now seen corresponding path program 1 times [2019-12-28 05:31:17,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:17,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111176189] [2019-12-28 05:31:17,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:17,831 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 05:31:17,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111176189] [2019-12-28 05:31:17,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:17,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:31:17,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983657189] [2019-12-28 05:31:17,832 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:18,126 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:18,150 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:31:18,150 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:18,151 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:31:18,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:31:18,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:18,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:31:18,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:31:18,152 INFO L87 Difference]: Start difference. First operand 43398 states and 156062 transitions. Second operand 6 states. [2019-12-28 05:31:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:18,746 INFO L93 Difference]: Finished difference Result 51187 states and 179497 transitions. [2019-12-28 05:31:18,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 05:31:18,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-28 05:31:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:18,850 INFO L225 Difference]: With dead ends: 51187 [2019-12-28 05:31:18,851 INFO L226 Difference]: Without dead ends: 51187 [2019-12-28 05:31:18,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 05:31:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51187 states. [2019-12-28 05:31:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51187 to 45430. [2019-12-28 05:31:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45430 states. [2019-12-28 05:31:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45430 states to 45430 states and 160426 transitions. [2019-12-28 05:31:19,633 INFO L78 Accepts]: Start accepts. Automaton has 45430 states and 160426 transitions. Word has length 75 [2019-12-28 05:31:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:19,633 INFO L462 AbstractCegarLoop]: Abstraction has 45430 states and 160426 transitions. [2019-12-28 05:31:19,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:31:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 45430 states and 160426 transitions. [2019-12-28 05:31:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:31:19,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:19,670 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] [2019-12-28 05:31:19,670 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:19,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1626139630, now seen corresponding path program 1 times [2019-12-28 05:31:19,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:19,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015313962] [2019-12-28 05:31:19,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:19,744 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 05:31:19,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015313962] [2019-12-28 05:31:19,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:19,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:31:19,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440335317] [2019-12-28 05:31:19,748 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:19,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:19,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:31:19,786 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:19,788 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:31:19,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:31:19,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:19,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:31:19,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:31:19,789 INFO L87 Difference]: Start difference. First operand 45430 states and 160426 transitions. Second operand 5 states. [2019-12-28 05:31:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:20,695 INFO L93 Difference]: Finished difference Result 57019 states and 200691 transitions. [2019-12-28 05:31:20,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:31:20,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-28 05:31:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:20,814 INFO L225 Difference]: With dead ends: 57019 [2019-12-28 05:31:20,814 INFO L226 Difference]: Without dead ends: 57019 [2019-12-28 05:31:20,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:31:20,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57019 states. [2019-12-28 05:31:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57019 to 49069. [2019-12-28 05:31:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49069 states. [2019-12-28 05:31:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49069 states to 49069 states and 172037 transitions. [2019-12-28 05:31:21,674 INFO L78 Accepts]: Start accepts. Automaton has 49069 states and 172037 transitions. Word has length 75 [2019-12-28 05:31:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:21,675 INFO L462 AbstractCegarLoop]: Abstraction has 49069 states and 172037 transitions. [2019-12-28 05:31:21,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:31:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 49069 states and 172037 transitions. [2019-12-28 05:31:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:31:21,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:21,715 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] [2019-12-28 05:31:21,715 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:21,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2136673807, now seen corresponding path program 1 times [2019-12-28 05:31:21,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:21,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820444443] [2019-12-28 05:31:21,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:21,771 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 05:31:21,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820444443] [2019-12-28 05:31:21,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:21,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:31:21,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1175864267] [2019-12-28 05:31:21,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:21,784 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:21,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:31:21,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:21,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:31:21,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:31:21,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:21,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:31:21,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:31:21,811 INFO L87 Difference]: Start difference. First operand 49069 states and 172037 transitions. Second operand 5 states. [2019-12-28 05:31:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:22,809 INFO L93 Difference]: Finished difference Result 64393 states and 225636 transitions. [2019-12-28 05:31:22,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:31:22,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-28 05:31:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:22,943 INFO L225 Difference]: With dead ends: 64393 [2019-12-28 05:31:22,943 INFO L226 Difference]: Without dead ends: 64393 [2019-12-28 05:31:22,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 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 05:31:23,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64393 states. [2019-12-28 05:31:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64393 to 51957. [2019-12-28 05:31:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51957 states. [2019-12-28 05:31:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51957 states to 51957 states and 182151 transitions. [2019-12-28 05:31:23,950 INFO L78 Accepts]: Start accepts. Automaton has 51957 states and 182151 transitions. Word has length 75 [2019-12-28 05:31:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:23,950 INFO L462 AbstractCegarLoop]: Abstraction has 51957 states and 182151 transitions. [2019-12-28 05:31:23,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:31:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 51957 states and 182151 transitions. [2019-12-28 05:31:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:31:23,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:23,992 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] [2019-12-28 05:31:23,992 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:23,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:23,993 INFO L82 PathProgramCache]: Analyzing trace with hash 350839026, now seen corresponding path program 1 times [2019-12-28 05:31:23,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:23,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071656311] [2019-12-28 05:31:23,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:24,112 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 05:31:24,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071656311] [2019-12-28 05:31:24,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:24,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:31:24,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1419461004] [2019-12-28 05:31:24,113 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:24,129 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:24,155 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:31:24,156 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:24,156 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:31:24,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:31:24,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:24,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:31:24,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:31:24,158 INFO L87 Difference]: Start difference. First operand 51957 states and 182151 transitions. Second operand 6 states. [2019-12-28 05:31:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:24,817 INFO L93 Difference]: Finished difference Result 49842 states and 167712 transitions. [2019-12-28 05:31:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:31:24,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-28 05:31:24,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:24,919 INFO L225 Difference]: With dead ends: 49842 [2019-12-28 05:31:24,919 INFO L226 Difference]: Without dead ends: 49842 [2019-12-28 05:31:24,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:31:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49842 states. [2019-12-28 05:31:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49842 to 36559. [2019-12-28 05:31:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36559 states. [2019-12-28 05:31:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36559 states to 36559 states and 123944 transitions. [2019-12-28 05:31:25,576 INFO L78 Accepts]: Start accepts. Automaton has 36559 states and 123944 transitions. Word has length 75 [2019-12-28 05:31:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:25,577 INFO L462 AbstractCegarLoop]: Abstraction has 36559 states and 123944 transitions. [2019-12-28 05:31:25,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:31:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 36559 states and 123944 transitions. [2019-12-28 05:31:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:31:25,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:25,602 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] [2019-12-28 05:31:25,603 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:25,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:25,603 INFO L82 PathProgramCache]: Analyzing trace with hash -558608652, now seen corresponding path program 1 times [2019-12-28 05:31:25,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:25,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325287196] [2019-12-28 05:31:25,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:25,694 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 05:31:25,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325287196] [2019-12-28 05:31:25,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:25,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:31:25,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [956684339] [2019-12-28 05:31:25,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:25,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:25,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:31:25,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:25,760 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 05:31:25,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:31:25,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:25,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:31:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:31:25,761 INFO L87 Difference]: Start difference. First operand 36559 states and 123944 transitions. Second operand 7 states. [2019-12-28 05:31:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:25,907 INFO L93 Difference]: Finished difference Result 13933 states and 42710 transitions. [2019-12-28 05:31:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:31:25,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-28 05:31:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:25,931 INFO L225 Difference]: With dead ends: 13933 [2019-12-28 05:31:25,932 INFO L226 Difference]: Without dead ends: 12115 [2019-12-28 05:31:25,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:31:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12115 states. [2019-12-28 05:31:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12115 to 10863. [2019-12-28 05:31:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10863 states. [2019-12-28 05:31:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10863 states to 10863 states and 33106 transitions. [2019-12-28 05:31:26,090 INFO L78 Accepts]: Start accepts. Automaton has 10863 states and 33106 transitions. Word has length 75 [2019-12-28 05:31:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:26,091 INFO L462 AbstractCegarLoop]: Abstraction has 10863 states and 33106 transitions. [2019-12-28 05:31:26,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:31:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 10863 states and 33106 transitions. [2019-12-28 05:31:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:26,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:26,103 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] [2019-12-28 05:31:26,104 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:26,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash -11366195, now seen corresponding path program 1 times [2019-12-28 05:31:26,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:26,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552876288] [2019-12-28 05:31:26,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:26,207 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 05:31:26,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552876288] [2019-12-28 05:31:26,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:26,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:31:26,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1248250300] [2019-12-28 05:31:26,209 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:26,230 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:26,312 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 209 transitions. [2019-12-28 05:31:26,312 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:26,388 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-28 05:31:26,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 05:31:26,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:26,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 05:31:26,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-28 05:31:26,389 INFO L87 Difference]: Start difference. First operand 10863 states and 33106 transitions. Second operand 11 states. [2019-12-28 05:31:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:27,975 INFO L93 Difference]: Finished difference Result 16541 states and 49584 transitions. [2019-12-28 05:31:27,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-28 05:31:27,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-12-28 05:31:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:28,000 INFO L225 Difference]: With dead ends: 16541 [2019-12-28 05:31:28,000 INFO L226 Difference]: Without dead ends: 16421 [2019-12-28 05:31:28,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2019-12-28 05:31:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16421 states. [2019-12-28 05:31:28,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16421 to 13503. [2019-12-28 05:31:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13503 states. [2019-12-28 05:31:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13503 states to 13503 states and 40722 transitions. [2019-12-28 05:31:28,202 INFO L78 Accepts]: Start accepts. Automaton has 13503 states and 40722 transitions. Word has length 92 [2019-12-28 05:31:28,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:28,202 INFO L462 AbstractCegarLoop]: Abstraction has 13503 states and 40722 transitions. [2019-12-28 05:31:28,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 05:31:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 13503 states and 40722 transitions. [2019-12-28 05:31:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:28,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:28,217 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] [2019-12-28 05:31:28,217 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:28,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2088575538, now seen corresponding path program 1 times [2019-12-28 05:31:28,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:28,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656137045] [2019-12-28 05:31:28,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:28,326 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 05:31:28,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656137045] [2019-12-28 05:31:28,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:28,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:31:28,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [513443495] [2019-12-28 05:31:28,328 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:28,347 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:28,429 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 209 transitions. [2019-12-28 05:31:28,430 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:28,430 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:31:28,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:31:28,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:28,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:31:28,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:31:28,432 INFO L87 Difference]: Start difference. First operand 13503 states and 40722 transitions. Second operand 7 states. [2019-12-28 05:31:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:28,590 INFO L93 Difference]: Finished difference Result 22233 states and 66561 transitions. [2019-12-28 05:31:28,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:31:28,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-28 05:31:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:28,614 INFO L225 Difference]: With dead ends: 22233 [2019-12-28 05:31:28,614 INFO L226 Difference]: Without dead ends: 12057 [2019-12-28 05:31:28,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:31:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12057 states. [2019-12-28 05:31:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12057 to 12057. [2019-12-28 05:31:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12057 states. [2019-12-28 05:31:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12057 states to 12057 states and 36150 transitions. [2019-12-28 05:31:28,780 INFO L78 Accepts]: Start accepts. Automaton has 12057 states and 36150 transitions. Word has length 92 [2019-12-28 05:31:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:28,780 INFO L462 AbstractCegarLoop]: Abstraction has 12057 states and 36150 transitions. [2019-12-28 05:31:28,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:31:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 12057 states and 36150 transitions. [2019-12-28 05:31:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:28,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:28,794 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] [2019-12-28 05:31:28,794 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:28,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1620378800, now seen corresponding path program 2 times [2019-12-28 05:31:28,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:28,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362881141] [2019-12-28 05:31:28,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:28,936 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 05:31:28,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362881141] [2019-12-28 05:31:28,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:28,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 05:31:28,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1247363273] [2019-12-28 05:31:28,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:28,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:29,015 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 212 transitions. [2019-12-28 05:31:29,015 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:29,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:31:29,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 05:31:29,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:29,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 05:31:29,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 05:31:29,038 INFO L87 Difference]: Start difference. First operand 12057 states and 36150 transitions. Second operand 11 states. [2019-12-28 05:31:31,576 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-28 05:31:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:31,584 INFO L93 Difference]: Finished difference Result 44957 states and 134432 transitions. [2019-12-28 05:31:31,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-28 05:31:31,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-12-28 05:31:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:31,631 INFO L225 Difference]: With dead ends: 44957 [2019-12-28 05:31:31,631 INFO L226 Difference]: Without dead ends: 32354 [2019-12-28 05:31:31,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2019-12-28 05:31:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32354 states. [2019-12-28 05:31:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32354 to 15087. [2019-12-28 05:31:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15087 states. [2019-12-28 05:31:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15087 states to 15087 states and 43821 transitions. [2019-12-28 05:31:31,935 INFO L78 Accepts]: Start accepts. Automaton has 15087 states and 43821 transitions. Word has length 92 [2019-12-28 05:31:31,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:31,935 INFO L462 AbstractCegarLoop]: Abstraction has 15087 states and 43821 transitions. [2019-12-28 05:31:31,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 05:31:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 15087 states and 43821 transitions. [2019-12-28 05:31:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:31,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:31,951 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] [2019-12-28 05:31:31,951 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:31,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:31,952 INFO L82 PathProgramCache]: Analyzing trace with hash 380772358, now seen corresponding path program 3 times [2019-12-28 05:31:31,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:31,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731259569] [2019-12-28 05:31:31,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:32,114 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 05:31:32,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731259569] [2019-12-28 05:31:32,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:32,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-28 05:31:32,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [859925990] [2019-12-28 05:31:32,115 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:32,134 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:32,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 348 transitions. [2019-12-28 05:31:32,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:32,646 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-28 05:31:32,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-28 05:31:32,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:32,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-28 05:31:32,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-28 05:31:32,647 INFO L87 Difference]: Start difference. First operand 15087 states and 43821 transitions. Second operand 20 states. [2019-12-28 05:31:39,226 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-12-28 05:31:39,736 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-12-28 05:31:40,075 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-12-28 05:31:40,865 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-12-28 05:31:41,328 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-12-28 05:31:42,103 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-12-28 05:31:44,407 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-12-28 05:31:45,124 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-12-28 05:31:45,286 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-12-28 05:31:47,335 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-12-28 05:31:47,752 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-12-28 05:31:47,916 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-12-28 05:31:48,453 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-12-28 05:31:48,709 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-12-28 05:31:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:50,475 INFO L93 Difference]: Finished difference Result 88574 states and 258860 transitions. [2019-12-28 05:31:50,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-12-28 05:31:50,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 92 [2019-12-28 05:31:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:50,616 INFO L225 Difference]: With dead ends: 88574 [2019-12-28 05:31:50,616 INFO L226 Difference]: Without dead ends: 77897 [2019-12-28 05:31:50,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16716 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=5140, Invalid=34660, Unknown=0, NotChecked=0, Total=39800 [2019-12-28 05:31:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77897 states. [2019-12-28 05:31:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77897 to 13497. [2019-12-28 05:31:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13497 states. [2019-12-28 05:31:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13497 states to 13497 states and 39992 transitions. [2019-12-28 05:31:51,266 INFO L78 Accepts]: Start accepts. Automaton has 13497 states and 39992 transitions. Word has length 92 [2019-12-28 05:31:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:51,266 INFO L462 AbstractCegarLoop]: Abstraction has 13497 states and 39992 transitions. [2019-12-28 05:31:51,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-28 05:31:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 13497 states and 39992 transitions. [2019-12-28 05:31:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:51,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:51,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:31:51,282 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1218439478, now seen corresponding path program 4 times [2019-12-28 05:31:51,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:51,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910869011] [2019-12-28 05:31:51,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:31:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:31:51,365 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 05:31:51,365 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 05:31:51,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 05:31:51 BasicIcfg [2019-12-28 05:31:51,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 05:31:51,551 INFO L168 Benchmark]: Toolchain (without parser) took 186895.15 ms. Allocated memory was 136.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-28 05:31:51,551 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-28 05:31:51,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.91 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.6 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:51,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.42 ms. Allocated memory is still 201.3 MB. Free memory was 155.6 MB in the beginning and 153.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:51,557 INFO L168 Benchmark]: Boogie Preprocessor took 38.03 ms. Allocated memory is still 201.3 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:51,561 INFO L168 Benchmark]: RCFGBuilder took 808.31 ms. Allocated memory is still 201.3 MB. Free memory was 150.8 MB in the beginning and 107.9 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:51,562 INFO L168 Benchmark]: TraceAbstraction took 185154.64 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.2 GB). Free memory was 107.2 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-28 05:31:51,569 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.26 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.91 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.6 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.42 ms. Allocated memory is still 201.3 MB. Free memory was 155.6 MB in the beginning and 153.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.03 ms. Allocated memory is still 201.3 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.31 ms. Allocated memory is still 201.3 MB. Free memory was 150.8 MB in the beginning and 107.9 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 185154.64 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.2 GB). Free memory was 107.2 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L701] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L703] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L705] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L706] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L707] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L708] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L709] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L710] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L711] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L712] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L713] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L714] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L715] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2589; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2590; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2591; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2591, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 3 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 z = 2 [L734] 1 __unbuffered_p0_EAX = x [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 y = y$flush_delayed ? y$mem_tmp : y [L764] 2 y$flush_delayed = (_Bool)0 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 184.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 75.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7379 SDtfs, 14155 SDslu, 25069 SDs, 0 SdLazy, 11359 SolverSat, 859 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 119 SyntacticMatches, 7 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17191 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228422occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 80.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 293312 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1707 NumberOfCodeBlocks, 1707 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1592 ConstructedInterpolants, 0 QuantifiedInterpolants, 343139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...