./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ca871fcb394143f3e78707b860cbdb77f0f565b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:27:23,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:27:23,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:27:23,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:27:23,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:27:23,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:27:23,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:27:23,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:27:23,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:27:23,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:27:23,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:27:23,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:27:23,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:27:23,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:27:23,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:27:23,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:27:23,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:27:23,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:27:23,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:27:23,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:27:23,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:27:23,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:27:23,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:27:23,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:27:23,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:27:23,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:27:23,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:27:23,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:27:23,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:27:23,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:27:23,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:27:23,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:27:23,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:27:23,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:27:23,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:27:23,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:27:23,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:27:23,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:27:23,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:27:23,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:27:23,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:27:23,782 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:27:23,798 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:27:23,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:27:23,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:27:23,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:27:23,801 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:27:23,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:27:23,801 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:27:23,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:27:23,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:27:23,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:27:23,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:27:23,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:27:23,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:27:23,803 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:27:23,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:27:23,804 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:27:23,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:27:23,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:27:23,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:27:23,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:27:23,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:27:23,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:27:23,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:27:23,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:27:23,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:27:23,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:27:23,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:27:23,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:27:23,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ca871fcb394143f3e78707b860cbdb77f0f565b [2019-11-15 21:27:23,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:27:23,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:27:23,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:27:23,857 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:27:23,858 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:27:23,859 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_pso.oepc.i [2019-11-15 21:27:23,917 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/data/309b6b844/604a07cba5df45a4820110198cd18147/FLAG1d996b19b [2019-11-15 21:27:24,473 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:27:24,476 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/sv-benchmarks/c/pthread-wmm/mix031_pso.oepc.i [2019-11-15 21:27:24,503 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/data/309b6b844/604a07cba5df45a4820110198cd18147/FLAG1d996b19b [2019-11-15 21:27:24,717 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/data/309b6b844/604a07cba5df45a4820110198cd18147 [2019-11-15 21:27:24,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:27:24,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:27:24,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:27:24,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:27:24,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:27:24,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:27:24" (1/1) ... [2019-11-15 21:27:24,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f773146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:24, skipping insertion in model container [2019-11-15 21:27:24,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:27:24" (1/1) ... [2019-11-15 21:27:24,744 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:27:24,808 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:27:25,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:27:25,331 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:27:25,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:27:25,538 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:27:25,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25 WrapperNode [2019-11-15 21:27:25,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:27:25,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:27:25,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:27:25,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:27:25,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25" (1/1) ... [2019-11-15 21:27:25,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25" (1/1) ... [2019-11-15 21:27:25,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:27:25,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:27:25,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:27:25,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:27:25,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25" (1/1) ... [2019-11-15 21:27:25,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25" (1/1) ... [2019-11-15 21:27:25,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25" (1/1) ... [2019-11-15 21:27:25,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25" (1/1) ... [2019-11-15 21:27:25,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25" (1/1) ... [2019-11-15 21:27:25,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25" (1/1) ... [2019-11-15 21:27:25,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25" (1/1) ... [2019-11-15 21:27:25,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:27:25,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:27:25,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:27:25,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:27:25,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/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-11-15 21:27:25,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:27:25,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 21:27:25,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:27:25,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:27:25,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 21:27:25,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 21:27:25,755 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 21:27:25,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 21:27:25,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 21:27:25,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:27:25,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:27:25,758 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 21:27:26,656 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:27:26,656 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:27:26,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:27:26 BoogieIcfgContainer [2019-11-15 21:27:26,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:27:26,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:27:26,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:27:26,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:27:26,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:27:24" (1/3) ... [2019-11-15 21:27:26,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5e0acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:27:26, skipping insertion in model container [2019-11-15 21:27:26,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:25" (2/3) ... [2019-11-15 21:27:26,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5e0acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:27:26, skipping insertion in model container [2019-11-15 21:27:26,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:27:26" (3/3) ... [2019-11-15 21:27:26,667 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.oepc.i [2019-11-15 21:27:26,709 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,709 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,710 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,710 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,710 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,710 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,710 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,711 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,711 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,711 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,711 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,712 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,712 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,712 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,712 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,713 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,713 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,713 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,713 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,713 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,714 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,714 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,714 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,714 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,714 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,715 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,715 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,715 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,715 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,715 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,716 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,716 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,716 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,716 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,717 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,718 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,718 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,718 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,718 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,718 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,718 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,719 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,719 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,719 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,719 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,719 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,720 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,720 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,720 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,720 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,721 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,721 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,721 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,721 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,721 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,721 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,722 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,722 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,722 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,723 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,723 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,723 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,723 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,723 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,724 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,724 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,724 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,724 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,726 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,726 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,726 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,726 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,726 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,728 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,728 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,728 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,728 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,728 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,729 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,729 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,729 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,729 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,729 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,730 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,730 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,730 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,730 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,731 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,731 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,731 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,731 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,731 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,731 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,732 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,732 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,732 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,733 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,733 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,733 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,733 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,733 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,734 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,734 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,734 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,734 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,735 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,735 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,735 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,735 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,735 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,736 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,736 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,736 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,736 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,736 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,737 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,737 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,737 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,737 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,737 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,738 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,738 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,738 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,738 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,738 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,739 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,739 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,739 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,739 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,739 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,740 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,740 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,740 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,740 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,741 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,741 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,741 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,741 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,741 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,742 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,742 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,742 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,742 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:26,751 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 21:27:26,751 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:27:26,760 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 21:27:26,772 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 21:27:26,794 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:27:26,794 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:27:26,795 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:27:26,795 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:27:26,795 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:27:26,795 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:27:26,795 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:27:26,795 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:27:26,810 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144 places, 182 transitions [2019-11-15 21:27:30,015 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32594 states. [2019-11-15 21:27:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 32594 states. [2019-11-15 21:27:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 21:27:30,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:30,032 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:30,037 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:30,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:30,045 INFO L82 PathProgramCache]: Analyzing trace with hash -867481609, now seen corresponding path program 1 times [2019-11-15 21:27:30,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:30,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704938346] [2019-11-15 21:27:30,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:30,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:30,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:30,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704938346] [2019-11-15 21:27:30,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:30,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:27:30,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861512211] [2019-11-15 21:27:30,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:27:30,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:30,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:27:30,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:27:30,381 INFO L87 Difference]: Start difference. First operand 32594 states. Second operand 4 states. [2019-11-15 21:27:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:31,508 INFO L93 Difference]: Finished difference Result 33594 states and 129571 transitions. [2019-11-15 21:27:31,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:27:31,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 21:27:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:31,763 INFO L225 Difference]: With dead ends: 33594 [2019-11-15 21:27:31,763 INFO L226 Difference]: Without dead ends: 25706 [2019-11-15 21:27:31,764 INFO L600 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-11-15 21:27:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25706 states. [2019-11-15 21:27:33,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25706 to 25706. [2019-11-15 21:27:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25706 states. [2019-11-15 21:27:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25706 states to 25706 states and 99587 transitions. [2019-11-15 21:27:33,464 INFO L78 Accepts]: Start accepts. Automaton has 25706 states and 99587 transitions. Word has length 37 [2019-11-15 21:27:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:33,465 INFO L462 AbstractCegarLoop]: Abstraction has 25706 states and 99587 transitions. [2019-11-15 21:27:33,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:27:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 25706 states and 99587 transitions. [2019-11-15 21:27:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 21:27:33,476 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:33,477 INFO L380 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] [2019-11-15 21:27:33,477 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:33,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:33,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1683273565, now seen corresponding path program 1 times [2019-11-15 21:27:33,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:33,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700627101] [2019-11-15 21:27:33,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:33,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:33,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:33,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700627101] [2019-11-15 21:27:33,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:33,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:27:33,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266997703] [2019-11-15 21:27:33,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:27:33,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:33,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:27:33,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:27:33,639 INFO L87 Difference]: Start difference. First operand 25706 states and 99587 transitions. Second operand 5 states. [2019-11-15 21:27:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:34,657 INFO L93 Difference]: Finished difference Result 41084 states and 150434 transitions. [2019-11-15 21:27:34,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:27:34,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-15 21:27:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:34,830 INFO L225 Difference]: With dead ends: 41084 [2019-11-15 21:27:34,830 INFO L226 Difference]: Without dead ends: 40548 [2019-11-15 21:27:34,831 INFO L600 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-11-15 21:27:35,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40548 states. [2019-11-15 21:27:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40548 to 38928. [2019-11-15 21:27:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38928 states. [2019-11-15 21:27:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38928 states to 38928 states and 143584 transitions. [2019-11-15 21:27:36,670 INFO L78 Accepts]: Start accepts. Automaton has 38928 states and 143584 transitions. Word has length 49 [2019-11-15 21:27:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:36,671 INFO L462 AbstractCegarLoop]: Abstraction has 38928 states and 143584 transitions. [2019-11-15 21:27:36,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:27:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 38928 states and 143584 transitions. [2019-11-15 21:27:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 21:27:36,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:36,680 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:36,681 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:36,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:36,682 INFO L82 PathProgramCache]: Analyzing trace with hash -506632681, now seen corresponding path program 1 times [2019-11-15 21:27:36,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:36,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957739666] [2019-11-15 21:27:36,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:36,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:36,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:36,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957739666] [2019-11-15 21:27:36,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:36,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:27:36,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406665995] [2019-11-15 21:27:36,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:27:36,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:36,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:27:36,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:27:36,808 INFO L87 Difference]: Start difference. First operand 38928 states and 143584 transitions. Second operand 5 states. [2019-11-15 21:27:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:37,514 INFO L93 Difference]: Finished difference Result 49781 states and 180636 transitions. [2019-11-15 21:27:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:27:37,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-15 21:27:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:38,396 INFO L225 Difference]: With dead ends: 49781 [2019-11-15 21:27:38,396 INFO L226 Difference]: Without dead ends: 49277 [2019-11-15 21:27:38,397 INFO L600 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-11-15 21:27:38,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49277 states. [2019-11-15 21:27:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49277 to 42680. [2019-11-15 21:27:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42680 states. [2019-11-15 21:27:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42680 states to 42680 states and 156595 transitions. [2019-11-15 21:27:39,605 INFO L78 Accepts]: Start accepts. Automaton has 42680 states and 156595 transitions. Word has length 50 [2019-11-15 21:27:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:39,606 INFO L462 AbstractCegarLoop]: Abstraction has 42680 states and 156595 transitions. [2019-11-15 21:27:39,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:27:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42680 states and 156595 transitions. [2019-11-15 21:27:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:27:39,617 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:39,617 INFO L380 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] [2019-11-15 21:27:39,617 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:39,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:39,618 INFO L82 PathProgramCache]: Analyzing trace with hash -571471363, now seen corresponding path program 1 times [2019-11-15 21:27:39,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:39,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191075757] [2019-11-15 21:27:39,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:39,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191075757] [2019-11-15 21:27:39,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:39,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:27:39,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906086859] [2019-11-15 21:27:39,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:27:39,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:39,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:27:39,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:27:39,684 INFO L87 Difference]: Start difference. First operand 42680 states and 156595 transitions. Second operand 3 states. [2019-11-15 21:27:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:40,044 INFO L93 Difference]: Finished difference Result 61090 states and 221433 transitions. [2019-11-15 21:27:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:27:40,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 21:27:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:40,267 INFO L225 Difference]: With dead ends: 61090 [2019-11-15 21:27:40,267 INFO L226 Difference]: Without dead ends: 61090 [2019-11-15 21:27:40,268 INFO L600 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-11-15 21:27:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61090 states. [2019-11-15 21:27:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61090 to 48019. [2019-11-15 21:27:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48019 states. [2019-11-15 21:27:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48019 states to 48019 states and 174182 transitions. [2019-11-15 21:27:42,267 INFO L78 Accepts]: Start accepts. Automaton has 48019 states and 174182 transitions. Word has length 52 [2019-11-15 21:27:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:42,268 INFO L462 AbstractCegarLoop]: Abstraction has 48019 states and 174182 transitions. [2019-11-15 21:27:42,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:27:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 48019 states and 174182 transitions. [2019-11-15 21:27:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:27:42,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:42,284 INFO L380 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-11-15 21:27:42,285 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:42,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:42,285 INFO L82 PathProgramCache]: Analyzing trace with hash 100088678, now seen corresponding path program 1 times [2019-11-15 21:27:42,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:42,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244684943] [2019-11-15 21:27:42,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:42,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244684943] [2019-11-15 21:27:42,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:42,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:27:42,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925845635] [2019-11-15 21:27:42,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:27:42,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:42,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:27:42,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:27:42,474 INFO L87 Difference]: Start difference. First operand 48019 states and 174182 transitions. Second operand 6 states. [2019-11-15 21:27:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:44,467 INFO L93 Difference]: Finished difference Result 63759 states and 229382 transitions. [2019-11-15 21:27:44,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:27:44,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 21:27:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:44,645 INFO L225 Difference]: With dead ends: 63759 [2019-11-15 21:27:44,645 INFO L226 Difference]: Without dead ends: 63759 [2019-11-15 21:27:44,646 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:27:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63759 states. [2019-11-15 21:27:45,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63759 to 59952. [2019-11-15 21:27:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59952 states. [2019-11-15 21:27:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59952 states to 59952 states and 215675 transitions. [2019-11-15 21:27:45,974 INFO L78 Accepts]: Start accepts. Automaton has 59952 states and 215675 transitions. Word has length 56 [2019-11-15 21:27:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:45,975 INFO L462 AbstractCegarLoop]: Abstraction has 59952 states and 215675 transitions. [2019-11-15 21:27:45,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:27:45,975 INFO L276 IsEmpty]: Start isEmpty. Operand 59952 states and 215675 transitions. [2019-11-15 21:27:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:27:45,991 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:45,991 INFO L380 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-11-15 21:27:45,992 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:45,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1696862681, now seen corresponding path program 1 times [2019-11-15 21:27:45,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:45,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521000975] [2019-11-15 21:27:45,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:45,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:45,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:46,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521000975] [2019-11-15 21:27:46,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:46,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:27:46,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991820719] [2019-11-15 21:27:46,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:27:46,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:46,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:27:46,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:27:46,149 INFO L87 Difference]: Start difference. First operand 59952 states and 215675 transitions. Second operand 7 states. [2019-11-15 21:27:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:47,689 INFO L93 Difference]: Finished difference Result 83688 states and 290100 transitions. [2019-11-15 21:27:47,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:27:47,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-15 21:27:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:47,874 INFO L225 Difference]: With dead ends: 83688 [2019-11-15 21:27:47,874 INFO L226 Difference]: Without dead ends: 83688 [2019-11-15 21:27:47,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:27:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83688 states. [2019-11-15 21:27:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83688 to 71015. [2019-11-15 21:27:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71015 states. [2019-11-15 21:27:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71015 states to 71015 states and 249889 transitions. [2019-11-15 21:27:53,258 INFO L78 Accepts]: Start accepts. Automaton has 71015 states and 249889 transitions. Word has length 56 [2019-11-15 21:27:53,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:53,259 INFO L462 AbstractCegarLoop]: Abstraction has 71015 states and 249889 transitions. [2019-11-15 21:27:53,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:27:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 71015 states and 249889 transitions. [2019-11-15 21:27:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:27:53,275 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:53,275 INFO L380 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-11-15 21:27:53,276 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:53,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:53,276 INFO L82 PathProgramCache]: Analyzing trace with hash -809359000, now seen corresponding path program 1 times [2019-11-15 21:27:53,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:53,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55879716] [2019-11-15 21:27:53,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:53,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:53,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:53,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55879716] [2019-11-15 21:27:53,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:53,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:27:53,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722673414] [2019-11-15 21:27:53,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:27:53,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:53,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:27:53,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:27:53,354 INFO L87 Difference]: Start difference. First operand 71015 states and 249889 transitions. Second operand 3 states. [2019-11-15 21:27:53,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:53,719 INFO L93 Difference]: Finished difference Result 54024 states and 188921 transitions. [2019-11-15 21:27:53,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:27:53,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-15 21:27:53,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:53,885 INFO L225 Difference]: With dead ends: 54024 [2019-11-15 21:27:53,885 INFO L226 Difference]: Without dead ends: 54024 [2019-11-15 21:27:53,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:27:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54024 states. [2019-11-15 21:27:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54024 to 53409. [2019-11-15 21:27:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53409 states. [2019-11-15 21:27:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53409 states to 53409 states and 187040 transitions. [2019-11-15 21:27:55,759 INFO L78 Accepts]: Start accepts. Automaton has 53409 states and 187040 transitions. Word has length 56 [2019-11-15 21:27:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:55,760 INFO L462 AbstractCegarLoop]: Abstraction has 53409 states and 187040 transitions. [2019-11-15 21:27:55,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:27:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 53409 states and 187040 transitions. [2019-11-15 21:27:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:27:55,770 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:55,770 INFO L380 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-11-15 21:27:55,770 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:55,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1710341576, now seen corresponding path program 1 times [2019-11-15 21:27:55,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:55,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834118259] [2019-11-15 21:27:55,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:55,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:55,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:55,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834118259] [2019-11-15 21:27:55,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:55,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:27:55,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825060048] [2019-11-15 21:27:55,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:27:55,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:55,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:27:55,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:27:55,871 INFO L87 Difference]: Start difference. First operand 53409 states and 187040 transitions. Second operand 6 states. [2019-11-15 21:27:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:56,666 INFO L93 Difference]: Finished difference Result 68649 states and 237304 transitions. [2019-11-15 21:27:56,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:27:56,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 21:27:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:56,819 INFO L225 Difference]: With dead ends: 68649 [2019-11-15 21:27:56,820 INFO L226 Difference]: Without dead ends: 68081 [2019-11-15 21:27:56,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:27:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68081 states. [2019-11-15 21:27:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68081 to 53493. [2019-11-15 21:27:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53493 states. [2019-11-15 21:27:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53493 states to 53493 states and 187737 transitions. [2019-11-15 21:27:58,090 INFO L78 Accepts]: Start accepts. Automaton has 53493 states and 187737 transitions. Word has length 56 [2019-11-15 21:27:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:58,090 INFO L462 AbstractCegarLoop]: Abstraction has 53493 states and 187737 transitions. [2019-11-15 21:27:58,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:27:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 53493 states and 187737 transitions. [2019-11-15 21:27:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:27:58,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:58,104 INFO L380 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] [2019-11-15 21:27:58,104 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:58,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:58,104 INFO L82 PathProgramCache]: Analyzing trace with hash 885787546, now seen corresponding path program 1 times [2019-11-15 21:27:58,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:58,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791344850] [2019-11-15 21:27:58,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:58,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:58,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:58,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791344850] [2019-11-15 21:27:58,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:58,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:27:58,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969083784] [2019-11-15 21:27:58,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:27:58,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:27:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:27:58,235 INFO L87 Difference]: Start difference. First operand 53493 states and 187737 transitions. Second operand 6 states. [2019-11-15 21:27:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:59,328 INFO L93 Difference]: Finished difference Result 67852 states and 231363 transitions. [2019-11-15 21:27:59,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:27:59,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-15 21:27:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:59,476 INFO L225 Difference]: With dead ends: 67852 [2019-11-15 21:27:59,476 INFO L226 Difference]: Without dead ends: 67852 [2019-11-15 21:27:59,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:28:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67852 states. [2019-11-15 21:28:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67852 to 59084. [2019-11-15 21:28:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59084 states. [2019-11-15 21:28:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59084 states to 59084 states and 204133 transitions. [2019-11-15 21:28:01,596 INFO L78 Accepts]: Start accepts. Automaton has 59084 states and 204133 transitions. Word has length 57 [2019-11-15 21:28:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:01,596 INFO L462 AbstractCegarLoop]: Abstraction has 59084 states and 204133 transitions. [2019-11-15 21:28:01,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:28:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 59084 states and 204133 transitions. [2019-11-15 21:28:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:28:01,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:01,609 INFO L380 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] [2019-11-15 21:28:01,609 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:01,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1773291227, now seen corresponding path program 1 times [2019-11-15 21:28:01,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:01,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25996610] [2019-11-15 21:28:01,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:01,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:01,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:01,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25996610] [2019-11-15 21:28:01,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:01,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:28:01,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094419335] [2019-11-15 21:28:01,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:28:01,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:01,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:28:01,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:28:01,710 INFO L87 Difference]: Start difference. First operand 59084 states and 204133 transitions. Second operand 4 states. [2019-11-15 21:28:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:01,789 INFO L93 Difference]: Finished difference Result 10215 states and 31249 transitions. [2019-11-15 21:28:01,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:28:01,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 21:28:01,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:01,807 INFO L225 Difference]: With dead ends: 10215 [2019-11-15 21:28:01,808 INFO L226 Difference]: Without dead ends: 8510 [2019-11-15 21:28:01,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:28:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2019-11-15 21:28:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 8462. [2019-11-15 21:28:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8462 states. [2019-11-15 21:28:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8462 states to 8462 states and 25328 transitions. [2019-11-15 21:28:01,984 INFO L78 Accepts]: Start accepts. Automaton has 8462 states and 25328 transitions. Word has length 57 [2019-11-15 21:28:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:01,985 INFO L462 AbstractCegarLoop]: Abstraction has 8462 states and 25328 transitions. [2019-11-15 21:28:01,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:28:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 8462 states and 25328 transitions. [2019-11-15 21:28:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:28:01,990 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:01,990 INFO L380 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] [2019-11-15 21:28:01,990 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:01,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:01,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1211133860, now seen corresponding path program 1 times [2019-11-15 21:28:01,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:01,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783011462] [2019-11-15 21:28:01,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:01,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:01,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:02,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783011462] [2019-11-15 21:28:02,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:02,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:28:02,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860807558] [2019-11-15 21:28:02,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:28:02,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:02,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:28:02,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:28:02,077 INFO L87 Difference]: Start difference. First operand 8462 states and 25328 transitions. Second operand 4 states. [2019-11-15 21:28:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:02,248 INFO L93 Difference]: Finished difference Result 9709 states and 29107 transitions. [2019-11-15 21:28:02,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:28:02,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 21:28:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:02,267 INFO L225 Difference]: With dead ends: 9709 [2019-11-15 21:28:02,267 INFO L226 Difference]: Without dead ends: 9709 [2019-11-15 21:28:02,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:28:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9709 states. [2019-11-15 21:28:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9709 to 8882. [2019-11-15 21:28:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8882 states. [2019-11-15 21:28:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8882 states to 8882 states and 26591 transitions. [2019-11-15 21:28:02,462 INFO L78 Accepts]: Start accepts. Automaton has 8882 states and 26591 transitions. Word has length 64 [2019-11-15 21:28:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:02,462 INFO L462 AbstractCegarLoop]: Abstraction has 8882 states and 26591 transitions. [2019-11-15 21:28:02,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:28:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 8882 states and 26591 transitions. [2019-11-15 21:28:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:28:02,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:02,468 INFO L380 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] [2019-11-15 21:28:02,468 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:02,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:02,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1341023101, now seen corresponding path program 1 times [2019-11-15 21:28:02,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:02,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930230404] [2019-11-15 21:28:02,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:02,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:02,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:02,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930230404] [2019-11-15 21:28:02,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:02,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:28:02,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603750787] [2019-11-15 21:28:02,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:28:02,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:02,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:28:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:28:02,607 INFO L87 Difference]: Start difference. First operand 8882 states and 26591 transitions. Second operand 6 states. [2019-11-15 21:28:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:02,966 INFO L93 Difference]: Finished difference Result 11198 states and 33078 transitions. [2019-11-15 21:28:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:28:02,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-15 21:28:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:02,982 INFO L225 Difference]: With dead ends: 11198 [2019-11-15 21:28:02,982 INFO L226 Difference]: Without dead ends: 11137 [2019-11-15 21:28:02,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:28:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11137 states. [2019-11-15 21:28:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11137 to 10413. [2019-11-15 21:28:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10413 states. [2019-11-15 21:28:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10413 states to 10413 states and 30945 transitions. [2019-11-15 21:28:03,139 INFO L78 Accepts]: Start accepts. Automaton has 10413 states and 30945 transitions. Word has length 64 [2019-11-15 21:28:03,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:03,139 INFO L462 AbstractCegarLoop]: Abstraction has 10413 states and 30945 transitions. [2019-11-15 21:28:03,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:28:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 10413 states and 30945 transitions. [2019-11-15 21:28:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 21:28:03,145 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:03,145 INFO L380 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] [2019-11-15 21:28:03,146 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:03,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:03,146 INFO L82 PathProgramCache]: Analyzing trace with hash -628357635, now seen corresponding path program 1 times [2019-11-15 21:28:03,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:03,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330490636] [2019-11-15 21:28:03,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:03,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:03,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:03,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330490636] [2019-11-15 21:28:03,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:03,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:28:03,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808352645] [2019-11-15 21:28:03,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:28:03,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:03,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:28:03,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:28:03,223 INFO L87 Difference]: Start difference. First operand 10413 states and 30945 transitions. Second operand 5 states. [2019-11-15 21:28:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:03,967 INFO L93 Difference]: Finished difference Result 23654 states and 70602 transitions. [2019-11-15 21:28:03,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:28:03,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 21:28:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:04,002 INFO L225 Difference]: With dead ends: 23654 [2019-11-15 21:28:04,002 INFO L226 Difference]: Without dead ends: 23654 [2019-11-15 21:28:04,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:28:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23654 states. [2019-11-15 21:28:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23654 to 12674. [2019-11-15 21:28:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12674 states. [2019-11-15 21:28:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12674 states to 12674 states and 37676 transitions. [2019-11-15 21:28:04,271 INFO L78 Accepts]: Start accepts. Automaton has 12674 states and 37676 transitions. Word has length 70 [2019-11-15 21:28:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:04,271 INFO L462 AbstractCegarLoop]: Abstraction has 12674 states and 37676 transitions. [2019-11-15 21:28:04,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:28:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 12674 states and 37676 transitions. [2019-11-15 21:28:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 21:28:04,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:04,278 INFO L380 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] [2019-11-15 21:28:04,279 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1869658302, now seen corresponding path program 1 times [2019-11-15 21:28:04,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:04,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733522237] [2019-11-15 21:28:04,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:04,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:04,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:04,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733522237] [2019-11-15 21:28:04,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:04,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:28:04,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883401163] [2019-11-15 21:28:04,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:28:04,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:04,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:28:04,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:28:04,349 INFO L87 Difference]: Start difference. First operand 12674 states and 37676 transitions. Second operand 4 states. [2019-11-15 21:28:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:04,725 INFO L93 Difference]: Finished difference Result 16712 states and 49066 transitions. [2019-11-15 21:28:04,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:28:04,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-15 21:28:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:04,750 INFO L225 Difference]: With dead ends: 16712 [2019-11-15 21:28:04,750 INFO L226 Difference]: Without dead ends: 16712 [2019-11-15 21:28:04,750 INFO L600 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-11-15 21:28:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16712 states. [2019-11-15 21:28:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16712 to 14441. [2019-11-15 21:28:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14441 states. [2019-11-15 21:28:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14441 states to 14441 states and 42582 transitions. [2019-11-15 21:28:04,982 INFO L78 Accepts]: Start accepts. Automaton has 14441 states and 42582 transitions. Word has length 70 [2019-11-15 21:28:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:04,983 INFO L462 AbstractCegarLoop]: Abstraction has 14441 states and 42582 transitions. [2019-11-15 21:28:04,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:28:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 14441 states and 42582 transitions. [2019-11-15 21:28:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 21:28:04,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:04,994 INFO L380 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] [2019-11-15 21:28:04,994 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:04,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1180544513, now seen corresponding path program 1 times [2019-11-15 21:28:04,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:04,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303716786] [2019-11-15 21:28:04,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:04,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:04,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:05,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303716786] [2019-11-15 21:28:05,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:05,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:28:05,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109472675] [2019-11-15 21:28:05,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:28:05,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:05,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:28:05,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:28:05,111 INFO L87 Difference]: Start difference. First operand 14441 states and 42582 transitions. Second operand 6 states. [2019-11-15 21:28:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:05,671 INFO L93 Difference]: Finished difference Result 15682 states and 45583 transitions. [2019-11-15 21:28:05,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:28:05,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-15 21:28:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:05,693 INFO L225 Difference]: With dead ends: 15682 [2019-11-15 21:28:05,693 INFO L226 Difference]: Without dead ends: 15682 [2019-11-15 21:28:05,693 INFO L600 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-11-15 21:28:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15682 states. [2019-11-15 21:28:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15682 to 15352. [2019-11-15 21:28:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15352 states. [2019-11-15 21:28:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15352 states to 15352 states and 44745 transitions. [2019-11-15 21:28:06,026 INFO L78 Accepts]: Start accepts. Automaton has 15352 states and 44745 transitions. Word has length 70 [2019-11-15 21:28:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:06,026 INFO L462 AbstractCegarLoop]: Abstraction has 15352 states and 44745 transitions. [2019-11-15 21:28:06,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:28:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 15352 states and 44745 transitions. [2019-11-15 21:28:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 21:28:06,037 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:06,037 INFO L380 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] [2019-11-15 21:28:06,037 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:06,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:06,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1037213440, now seen corresponding path program 1 times [2019-11-15 21:28:06,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:06,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415819018] [2019-11-15 21:28:06,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:06,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:06,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:06,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415819018] [2019-11-15 21:28:06,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:06,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:28:06,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266442649] [2019-11-15 21:28:06,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:28:06,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:06,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:28:06,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:28:06,145 INFO L87 Difference]: Start difference. First operand 15352 states and 44745 transitions. Second operand 6 states. [2019-11-15 21:28:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:06,695 INFO L93 Difference]: Finished difference Result 17510 states and 49627 transitions. [2019-11-15 21:28:06,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:28:06,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-15 21:28:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:06,719 INFO L225 Difference]: With dead ends: 17510 [2019-11-15 21:28:06,719 INFO L226 Difference]: Without dead ends: 17510 [2019-11-15 21:28:06,719 INFO L600 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-11-15 21:28:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17510 states. [2019-11-15 21:28:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17510 to 15893. [2019-11-15 21:28:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15893 states. [2019-11-15 21:28:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15893 states to 15893 states and 45582 transitions. [2019-11-15 21:28:06,959 INFO L78 Accepts]: Start accepts. Automaton has 15893 states and 45582 transitions. Word has length 70 [2019-11-15 21:28:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:06,959 INFO L462 AbstractCegarLoop]: Abstraction has 15893 states and 45582 transitions. [2019-11-15 21:28:06,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:28:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 15893 states and 45582 transitions. [2019-11-15 21:28:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 21:28:06,973 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:06,974 INFO L380 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] [2019-11-15 21:28:06,974 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1248564353, now seen corresponding path program 1 times [2019-11-15 21:28:06,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:06,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001925861] [2019-11-15 21:28:06,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:06,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:06,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:07,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001925861] [2019-11-15 21:28:07,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:07,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:28:07,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912072877] [2019-11-15 21:28:07,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:28:07,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:07,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:28:07,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:28:07,172 INFO L87 Difference]: Start difference. First operand 15893 states and 45582 transitions. Second operand 7 states. [2019-11-15 21:28:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:07,799 INFO L93 Difference]: Finished difference Result 18414 states and 51438 transitions. [2019-11-15 21:28:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:28:07,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-15 21:28:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:07,824 INFO L225 Difference]: With dead ends: 18414 [2019-11-15 21:28:07,824 INFO L226 Difference]: Without dead ends: 18414 [2019-11-15 21:28:07,825 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:28:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18414 states. [2019-11-15 21:28:08,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18414 to 16245. [2019-11-15 21:28:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16245 states. [2019-11-15 21:28:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16245 states to 16245 states and 45209 transitions. [2019-11-15 21:28:08,077 INFO L78 Accepts]: Start accepts. Automaton has 16245 states and 45209 transitions. Word has length 70 [2019-11-15 21:28:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:08,077 INFO L462 AbstractCegarLoop]: Abstraction has 16245 states and 45209 transitions. [2019-11-15 21:28:08,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:28:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 16245 states and 45209 transitions. [2019-11-15 21:28:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 21:28:08,084 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:08,085 INFO L380 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] [2019-11-15 21:28:08,085 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:08,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2136068034, now seen corresponding path program 1 times [2019-11-15 21:28:08,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:08,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763939425] [2019-11-15 21:28:08,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:08,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:08,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:08,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763939425] [2019-11-15 21:28:08,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:08,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:28:08,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891312481] [2019-11-15 21:28:08,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:28:08,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:08,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:28:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:28:08,169 INFO L87 Difference]: Start difference. First operand 16245 states and 45209 transitions. Second operand 5 states. [2019-11-15 21:28:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:08,236 INFO L93 Difference]: Finished difference Result 5337 states and 12605 transitions. [2019-11-15 21:28:08,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:28:08,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 21:28:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:08,243 INFO L225 Difference]: With dead ends: 5337 [2019-11-15 21:28:08,243 INFO L226 Difference]: Without dead ends: 4650 [2019-11-15 21:28:08,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:28:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2019-11-15 21:28:08,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4325. [2019-11-15 21:28:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4325 states. [2019-11-15 21:28:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 9952 transitions. [2019-11-15 21:28:08,320 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 9952 transitions. Word has length 70 [2019-11-15 21:28:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:08,321 INFO L462 AbstractCegarLoop]: Abstraction has 4325 states and 9952 transitions. [2019-11-15 21:28:08,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:28:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 9952 transitions. [2019-11-15 21:28:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 21:28:08,326 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:08,327 INFO L380 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] [2019-11-15 21:28:08,327 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:08,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash -687461772, now seen corresponding path program 1 times [2019-11-15 21:28:08,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:08,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649723227] [2019-11-15 21:28:08,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:08,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:08,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:08,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649723227] [2019-11-15 21:28:08,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:08,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:08,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558400668] [2019-11-15 21:28:08,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:08,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:08,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:08,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:08,366 INFO L87 Difference]: Start difference. First operand 4325 states and 9952 transitions. Second operand 3 states. [2019-11-15 21:28:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:08,407 INFO L93 Difference]: Finished difference Result 5345 states and 12117 transitions. [2019-11-15 21:28:08,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:08,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-15 21:28:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:08,413 INFO L225 Difference]: With dead ends: 5345 [2019-11-15 21:28:08,413 INFO L226 Difference]: Without dead ends: 5345 [2019-11-15 21:28:08,414 INFO L600 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-11-15 21:28:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2019-11-15 21:28:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 4260. [2019-11-15 21:28:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2019-11-15 21:28:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 9560 transitions. [2019-11-15 21:28:08,480 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 9560 transitions. Word has length 70 [2019-11-15 21:28:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:08,480 INFO L462 AbstractCegarLoop]: Abstraction has 4260 states and 9560 transitions. [2019-11-15 21:28:08,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 9560 transitions. [2019-11-15 21:28:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 21:28:08,485 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:08,486 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:08,486 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:08,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:08,487 INFO L82 PathProgramCache]: Analyzing trace with hash -61024697, now seen corresponding path program 1 times [2019-11-15 21:28:08,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:08,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698674590] [2019-11-15 21:28:08,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:08,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:08,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:08,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698674590] [2019-11-15 21:28:08,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:08,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:28:08,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218545199] [2019-11-15 21:28:08,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:28:08,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:08,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:28:08,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:28:08,564 INFO L87 Difference]: Start difference. First operand 4260 states and 9560 transitions. Second operand 5 states. [2019-11-15 21:28:08,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:08,795 INFO L93 Difference]: Finished difference Result 5299 states and 11944 transitions. [2019-11-15 21:28:08,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:28:08,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-11-15 21:28:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:08,803 INFO L225 Difference]: With dead ends: 5299 [2019-11-15 21:28:08,803 INFO L226 Difference]: Without dead ends: 5299 [2019-11-15 21:28:08,803 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:28:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2019-11-15 21:28:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 4888. [2019-11-15 21:28:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-11-15 21:28:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10968 transitions. [2019-11-15 21:28:08,886 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10968 transitions. Word has length 76 [2019-11-15 21:28:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:08,886 INFO L462 AbstractCegarLoop]: Abstraction has 4888 states and 10968 transitions. [2019-11-15 21:28:08,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:28:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10968 transitions. [2019-11-15 21:28:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 21:28:08,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:08,893 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:08,893 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:08,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:08,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1681785638, now seen corresponding path program 1 times [2019-11-15 21:28:08,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:08,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816224398] [2019-11-15 21:28:08,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:08,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:08,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:08,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816224398] [2019-11-15 21:28:08,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:08,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:28:09,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066015956] [2019-11-15 21:28:09,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:28:09,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:09,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:28:09,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:28:09,005 INFO L87 Difference]: Start difference. First operand 4888 states and 10968 transitions. Second operand 7 states. [2019-11-15 21:28:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:09,408 INFO L93 Difference]: Finished difference Result 5520 states and 12289 transitions. [2019-11-15 21:28:09,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:28:09,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-11-15 21:28:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:09,413 INFO L225 Difference]: With dead ends: 5520 [2019-11-15 21:28:09,413 INFO L226 Difference]: Without dead ends: 5467 [2019-11-15 21:28:09,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:28:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2019-11-15 21:28:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 4912. [2019-11-15 21:28:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4912 states. [2019-11-15 21:28:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 10945 transitions. [2019-11-15 21:28:09,474 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 10945 transitions. Word has length 76 [2019-11-15 21:28:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:09,474 INFO L462 AbstractCegarLoop]: Abstraction has 4912 states and 10945 transitions. [2019-11-15 21:28:09,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:28:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 10945 transitions. [2019-11-15 21:28:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:28:09,479 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:09,480 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:09,480 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:09,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:09,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1160466807, now seen corresponding path program 1 times [2019-11-15 21:28:09,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:09,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266555383] [2019-11-15 21:28:09,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:09,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:09,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:09,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266555383] [2019-11-15 21:28:09,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:09,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:28:09,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092296535] [2019-11-15 21:28:09,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:28:09,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:09,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:28:09,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:28:09,553 INFO L87 Difference]: Start difference. First operand 4912 states and 10945 transitions. Second operand 4 states. [2019-11-15 21:28:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:09,706 INFO L93 Difference]: Finished difference Result 5854 states and 12960 transitions. [2019-11-15 21:28:09,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:28:09,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:28:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:09,714 INFO L225 Difference]: With dead ends: 5854 [2019-11-15 21:28:09,714 INFO L226 Difference]: Without dead ends: 5854 [2019-11-15 21:28:09,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:28:09,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-11-15 21:28:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5244. [2019-11-15 21:28:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5244 states. [2019-11-15 21:28:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 11647 transitions. [2019-11-15 21:28:09,790 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 11647 transitions. Word has length 97 [2019-11-15 21:28:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:09,791 INFO L462 AbstractCegarLoop]: Abstraction has 5244 states and 11647 transitions. [2019-11-15 21:28:09,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:28:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 11647 transitions. [2019-11-15 21:28:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:28:09,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:09,798 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:09,798 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:09,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:09,798 INFO L82 PathProgramCache]: Analyzing trace with hash -31124093, now seen corresponding path program 1 times [2019-11-15 21:28:09,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:09,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217234767] [2019-11-15 21:28:09,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:09,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:09,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:09,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217234767] [2019-11-15 21:28:09,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:09,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:28:09,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325596776] [2019-11-15 21:28:09,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:28:09,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:28:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:28:09,879 INFO L87 Difference]: Start difference. First operand 5244 states and 11647 transitions. Second operand 5 states. [2019-11-15 21:28:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:10,037 INFO L93 Difference]: Finished difference Result 5556 states and 12354 transitions. [2019-11-15 21:28:10,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:28:10,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-15 21:28:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:10,045 INFO L225 Difference]: With dead ends: 5556 [2019-11-15 21:28:10,045 INFO L226 Difference]: Without dead ends: 5556 [2019-11-15 21:28:10,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:28:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5556 states. [2019-11-15 21:28:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5556 to 4404. [2019-11-15 21:28:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2019-11-15 21:28:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 9763 transitions. [2019-11-15 21:28:10,124 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 9763 transitions. Word has length 99 [2019-11-15 21:28:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:10,125 INFO L462 AbstractCegarLoop]: Abstraction has 4404 states and 9763 transitions. [2019-11-15 21:28:10,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:28:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 9763 transitions. [2019-11-15 21:28:10,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:28:10,131 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:10,132 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:10,132 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash -953807676, now seen corresponding path program 1 times [2019-11-15 21:28:10,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:10,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41286826] [2019-11-15 21:28:10,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:10,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:10,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:10,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41286826] [2019-11-15 21:28:10,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:10,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:28:10,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773181725] [2019-11-15 21:28:10,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:28:10,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:10,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:28:10,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:28:10,224 INFO L87 Difference]: Start difference. First operand 4404 states and 9763 transitions. Second operand 5 states. [2019-11-15 21:28:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:10,696 INFO L93 Difference]: Finished difference Result 8571 states and 19059 transitions. [2019-11-15 21:28:10,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:28:10,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-15 21:28:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:10,707 INFO L225 Difference]: With dead ends: 8571 [2019-11-15 21:28:10,707 INFO L226 Difference]: Without dead ends: 8571 [2019-11-15 21:28:10,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:28:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8571 states. [2019-11-15 21:28:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8571 to 5559. [2019-11-15 21:28:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5559 states. [2019-11-15 21:28:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 12450 transitions. [2019-11-15 21:28:10,794 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 12450 transitions. Word has length 99 [2019-11-15 21:28:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:10,795 INFO L462 AbstractCegarLoop]: Abstraction has 5559 states and 12450 transitions. [2019-11-15 21:28:10,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:28:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 12450 transitions. [2019-11-15 21:28:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:28:10,801 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:10,802 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:10,802 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash 71684323, now seen corresponding path program 1 times [2019-11-15 21:28:10,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:10,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250402909] [2019-11-15 21:28:10,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:10,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:10,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:10,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250402909] [2019-11-15 21:28:10,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:10,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:28:10,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586713928] [2019-11-15 21:28:10,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:28:10,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:10,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:28:10,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:28:10,966 INFO L87 Difference]: Start difference. First operand 5559 states and 12450 transitions. Second operand 6 states. [2019-11-15 21:28:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:11,189 INFO L93 Difference]: Finished difference Result 6191 states and 13602 transitions. [2019-11-15 21:28:11,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:28:11,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 21:28:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:11,197 INFO L225 Difference]: With dead ends: 6191 [2019-11-15 21:28:11,197 INFO L226 Difference]: Without dead ends: 6154 [2019-11-15 21:28:11,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:28:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2019-11-15 21:28:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 5562. [2019-11-15 21:28:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5562 states. [2019-11-15 21:28:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5562 states to 5562 states and 12293 transitions. [2019-11-15 21:28:11,274 INFO L78 Accepts]: Start accepts. Automaton has 5562 states and 12293 transitions. Word has length 99 [2019-11-15 21:28:11,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:11,275 INFO L462 AbstractCegarLoop]: Abstraction has 5562 states and 12293 transitions. [2019-11-15 21:28:11,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:28:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5562 states and 12293 transitions. [2019-11-15 21:28:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:28:11,282 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:11,283 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:11,283 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:11,283 INFO L82 PathProgramCache]: Analyzing trace with hash -183052222, now seen corresponding path program 1 times [2019-11-15 21:28:11,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:11,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596757376] [2019-11-15 21:28:11,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:11,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:11,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:28:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:28:11,387 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:28:11,387 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:28:11,597 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 21:28:11,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:28:11 BasicIcfg [2019-11-15 21:28:11,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:28:11,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:28:11,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:28:11,602 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:28:11,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:27:26" (3/4) ... [2019-11-15 21:28:11,610 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:28:11,785 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b35d56a0-673a-4454-84a0-8bef80c919fc/bin/uautomizer/witness.graphml [2019-11-15 21:28:11,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:28:11,788 INFO L168 Benchmark]: Toolchain (without parser) took 47065.41 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 939.4 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-11-15 21:28:11,788 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:28:11,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:28:11,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:28:11,789 INFO L168 Benchmark]: Boogie Preprocessor took 53.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:28:11,790 INFO L168 Benchmark]: RCFGBuilder took 997.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:28:11,790 INFO L168 Benchmark]: TraceAbstraction took 44941.80 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:28:11,791 INFO L168 Benchmark]: Witness Printer took 184.14 ms. Allocated memory is still 4.8 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 73.1 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:28:11,793 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 814.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 997.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44941.80 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 184.14 ms. Allocated memory is still 4.8 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 73.1 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L705] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L706] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L707] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L708] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L709] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L710] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L711] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L712] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L713] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L714] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L715] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L716] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L717] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L718] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L728] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L813] 0 pthread_t t837; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t837, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L815] 0 pthread_t t838; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L732] 1 a$w_buff1 = a$w_buff0 [L733] 1 a$w_buff0 = 1 [L734] 1 a$w_buff1_used = a$w_buff0_used [L735] 1 a$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t838, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L783] EXPR 2 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L784] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] EXPR 2 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] 2 a = a$flush_delayed ? a$mem_tmp : a [L788] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L755] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L756] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L823] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L826] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L826] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. Result: UNSAFE, OverallTime: 44.8s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6926 SDtfs, 8411 SDslu, 13188 SDs, 0 SdLazy, 5767 SolverSat, 492 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71015occurred 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: 21.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 88447 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1789 NumberOfCodeBlocks, 1789 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1665 ConstructedInterpolants, 0 QuantifiedInterpolants, 312201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...