./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 874a9972fda7c5371d5beee908ce94ffa39446d7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-09 03:40:31,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 03:40:31,113 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 03:40:31,119 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 03:40:31,119 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 03:40:31,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 03:40:31,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 03:40:31,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 03:40:31,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 03:40:31,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 03:40:31,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 03:40:31,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 03:40:31,123 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 03:40:31,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 03:40:31,124 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 03:40:31,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 03:40:31,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 03:40:31,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 03:40:31,126 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 03:40:31,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 03:40:31,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 03:40:31,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 03:40:31,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 03:40:31,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 03:40:31,129 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 03:40:31,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 03:40:31,130 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 03:40:31,131 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 03:40:31,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 03:40:31,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 03:40:31,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 03:40:31,132 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 03:40:31,132 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 03:40:31,132 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 03:40:31,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 03:40:31,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 03:40:31,133 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 03:40:31,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 03:40:31,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 03:40:31,141 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 03:40:31,141 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 03:40:31,141 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 03:40:31,141 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 03:40:31,142 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 03:40:31,142 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 03:40:31,142 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 03:40:31,142 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 03:40:31,142 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 03:40:31,142 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 03:40:31,142 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 03:40:31,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 03:40:31,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 03:40:31,143 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 03:40:31,143 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 03:40:31,143 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 03:40:31,143 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 03:40:31,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 03:40:31,143 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 03:40:31,143 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 03:40:31,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 03:40:31,143 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 03:40:31,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 03:40:31,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 03:40:31,143 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 03:40:31,144 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 03:40:31,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 03:40:31,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 03:40:31,144 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 03:40:31,144 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 03:40:31,144 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 03:40:31,144 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 03:40:31,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 03:40:31,144 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 03:40:31,144 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan 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 -> Taipan 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 -> 874a9972fda7c5371d5beee908ce94ffa39446d7 [2018-12-09 03:40:31,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 03:40:31,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 03:40:31,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 03:40:31,171 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 03:40:31,171 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 03:40:31,171 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2018-12-09 03:40:31,206 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/data/a2873d437/9596bf3b05bc4110b5d6549e7ac60da9/FLAG495f2971d [2018-12-09 03:40:31,718 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 03:40:31,718 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2018-12-09 03:40:31,728 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/data/a2873d437/9596bf3b05bc4110b5d6549e7ac60da9/FLAG495f2971d [2018-12-09 03:40:32,241 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/data/a2873d437/9596bf3b05bc4110b5d6549e7ac60da9 [2018-12-09 03:40:32,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 03:40:32,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 03:40:32,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 03:40:32,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 03:40:32,248 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 03:40:32,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:40:32" (1/1) ... [2018-12-09 03:40:32,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f79a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32, skipping insertion in model container [2018-12-09 03:40:32,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:40:32" (1/1) ... [2018-12-09 03:40:32,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 03:40:32,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 03:40:32,467 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:40:32,475 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 03:40:32,562 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:40:32,606 INFO L195 MainTranslator]: Completed translation [2018-12-09 03:40:32,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32 WrapperNode [2018-12-09 03:40:32,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 03:40:32,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 03:40:32,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 03:40:32,608 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 03:40:32,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32" (1/1) ... [2018-12-09 03:40:32,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32" (1/1) ... [2018-12-09 03:40:32,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 03:40:32,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 03:40:32,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 03:40:32,645 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 03:40:32,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32" (1/1) ... [2018-12-09 03:40:32,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32" (1/1) ... [2018-12-09 03:40:32,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32" (1/1) ... [2018-12-09 03:40:32,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32" (1/1) ... [2018-12-09 03:40:32,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32" (1/1) ... [2018-12-09 03:40:32,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32" (1/1) ... [2018-12-09 03:40:32,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32" (1/1) ... [2018-12-09 03:40:32,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 03:40:32,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 03:40:32,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 03:40:32,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 03:40:32,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/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 [2018-12-09 03:40:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 03:40:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 03:40:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 03:40:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 03:40:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 03:40:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 03:40:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 03:40:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 03:40:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 03:40:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 03:40:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 03:40:32,699 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 03:40:32,980 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 03:40:32,980 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 03:40:32,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:40:32 BoogieIcfgContainer [2018-12-09 03:40:32,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 03:40:32,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 03:40:32,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 03:40:32,983 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 03:40:32,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:40:32" (1/3) ... [2018-12-09 03:40:32,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd3cc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:40:32, skipping insertion in model container [2018-12-09 03:40:32,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:32" (2/3) ... [2018-12-09 03:40:32,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd3cc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:40:32, skipping insertion in model container [2018-12-09 03:40:32,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:40:32" (3/3) ... [2018-12-09 03:40:32,985 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc_false-unreach-call.i [2018-12-09 03:40:33,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,008 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,008 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,008 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,009 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,009 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,014 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,015 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:40:33,036 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 03:40:33,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 03:40:33,042 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 03:40:33,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 03:40:33,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 03:40:33,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 03:40:33,066 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 03:40:33,066 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 03:40:33,066 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 03:40:33,066 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 03:40:33,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 03:40:33,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 03:40:33,072 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 03:40:34,527 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-09 03:40:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-09 03:40:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 03:40:34,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:34,533 INFO L402 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] [2018-12-09 03:40:34,535 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:34,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-09 03:40:34,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:34,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:34,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:34,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:34,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:34,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:34,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:40:34,673 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:34,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:40:34,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:40:34,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:40:34,686 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-09 03:40:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:35,168 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-09 03:40:35,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:40:35,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-09 03:40:35,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:35,320 INFO L225 Difference]: With dead ends: 60791 [2018-12-09 03:40:35,321 INFO L226 Difference]: Without dead ends: 44271 [2018-12-09 03:40:35,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:40:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-09 03:40:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-09 03:40:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-09 03:40:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-09 03:40:36,191 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-09 03:40:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:36,191 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-09 03:40:36,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:40:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-09 03:40:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 03:40:36,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:36,195 INFO L402 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] [2018-12-09 03:40:36,196 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:36,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:36,196 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-09 03:40:36,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:36,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:36,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:36,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:36,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:36,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:36,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:40:36,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:36,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:40:36,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:40:36,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:36,257 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-09 03:40:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:37,058 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-09 03:40:37,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:40:37,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 03:40:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:37,298 INFO L225 Difference]: With dead ends: 64005 [2018-12-09 03:40:37,298 INFO L226 Difference]: Without dead ends: 63453 [2018-12-09 03:40:37,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:40:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-09 03:40:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-09 03:40:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-09 03:40:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-09 03:40:38,248 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-09 03:40:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:38,249 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-09 03:40:38,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:40:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-09 03:40:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 03:40:38,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:38,254 INFO L402 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] [2018-12-09 03:40:38,254 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:38,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-09 03:40:38,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:38,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:38,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:38,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:38,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:38,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:38,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:40:38,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:38,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:40:38,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:40:38,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:38,321 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-09 03:40:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:38,774 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-09 03:40:38,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:40:38,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 03:40:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:38,928 INFO L225 Difference]: With dead ends: 81367 [2018-12-09 03:40:38,928 INFO L226 Difference]: Without dead ends: 80855 [2018-12-09 03:40:38,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:40:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-09 03:40:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-09 03:40:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-09 03:40:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-09 03:40:39,958 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-09 03:40:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:39,959 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-09 03:40:39,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:40:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-09 03:40:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 03:40:39,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:39,964 INFO L402 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] [2018-12-09 03:40:39,965 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:39,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-09 03:40:39,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:39,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:39,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:39,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:39,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:39,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:39,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:40:39,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:39,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:40:39,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:40:39,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:40:39,993 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-09 03:40:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:40,232 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-09 03:40:40,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:40:40,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 03:40:40,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:40,354 INFO L225 Difference]: With dead ends: 65251 [2018-12-09 03:40:40,354 INFO L226 Difference]: Without dead ends: 65251 [2018-12-09 03:40:40,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:40:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-09 03:40:41,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-09 03:40:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-09 03:40:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-09 03:40:41,315 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-09 03:40:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:41,315 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-09 03:40:41,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:40:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-09 03:40:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 03:40:41,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:41,325 INFO L402 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] [2018-12-09 03:40:41,326 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:41,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:41,326 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-09 03:40:41,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:41,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:41,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:41,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:41,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:40:41,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:41,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:40:41,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:40:41,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:40:41,418 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-09 03:40:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:41,939 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-09 03:40:41,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:40:41,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 03:40:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:42,066 INFO L225 Difference]: With dead ends: 67511 [2018-12-09 03:40:42,066 INFO L226 Difference]: Without dead ends: 67511 [2018-12-09 03:40:42,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:40:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-09 03:40:43,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-09 03:40:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-09 03:40:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-09 03:40:43,149 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-09 03:40:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:43,149 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-09 03:40:43,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:40:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-09 03:40:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 03:40:43,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:43,164 INFO L402 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] [2018-12-09 03:40:43,164 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:43,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-09 03:40:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:43,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:43,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:43,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:43,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:43,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:43,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:40:43,228 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:43,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:40:43,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:40:43,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:40:43,228 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-09 03:40:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:44,525 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-09 03:40:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 03:40:44,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-09 03:40:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:44,695 INFO L225 Difference]: With dead ends: 88528 [2018-12-09 03:40:44,695 INFO L226 Difference]: Without dead ends: 88528 [2018-12-09 03:40:44,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 03:40:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-09 03:40:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-09 03:40:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-09 03:40:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-09 03:40:46,001 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-09 03:40:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:46,002 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-09 03:40:46,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:40:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-09 03:40:46,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 03:40:46,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:46,011 INFO L402 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] [2018-12-09 03:40:46,011 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:46,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:46,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-09 03:40:46,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:46,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:46,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:46,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:46,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:46,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:46,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:40:46,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:46,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:40:46,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:40:46,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:40:46,055 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-09 03:40:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:46,247 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-09 03:40:46,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:40:46,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-09 03:40:46,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:46,355 INFO L225 Difference]: With dead ends: 57182 [2018-12-09 03:40:46,355 INFO L226 Difference]: Without dead ends: 57182 [2018-12-09 03:40:46,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:40:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-09 03:40:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-09 03:40:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-09 03:40:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-09 03:40:47,188 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-09 03:40:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:47,188 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-09 03:40:47,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:40:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-09 03:40:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 03:40:47,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:47,195 INFO L402 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] [2018-12-09 03:40:47,195 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:47,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:47,195 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-09 03:40:47,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:47,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:47,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:47,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:47,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:47,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:47,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:40:47,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:47,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:40:47,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:40:47,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:40:47,245 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-09 03:40:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:47,785 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-09 03:40:47,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 03:40:47,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 03:40:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:48,090 INFO L225 Difference]: With dead ends: 97908 [2018-12-09 03:40:48,090 INFO L226 Difference]: Without dead ends: 97332 [2018-12-09 03:40:48,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 03:40:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-09 03:40:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-09 03:40:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-09 03:40:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-09 03:40:49,119 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-09 03:40:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:49,119 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-09 03:40:49,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:40:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-09 03:40:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 03:40:49,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:49,126 INFO L402 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] [2018-12-09 03:40:49,126 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:49,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:49,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-09 03:40:49,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:49,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:49,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:49,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:49,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:49,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:49,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:40:49,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:49,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:40:49,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:40:49,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:49,193 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 5 states. [2018-12-09 03:40:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:49,509 INFO L93 Difference]: Finished difference Result 56810 states and 198218 transitions. [2018-12-09 03:40:49,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:40:49,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-09 03:40:49,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:49,610 INFO L225 Difference]: With dead ends: 56810 [2018-12-09 03:40:49,611 INFO L226 Difference]: Without dead ends: 56810 [2018-12-09 03:40:49,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:40:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56810 states. [2018-12-09 03:40:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56810 to 56721. [2018-12-09 03:40:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56721 states. [2018-12-09 03:40:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56721 states to 56721 states and 197943 transitions. [2018-12-09 03:40:50,639 INFO L78 Accepts]: Start accepts. Automaton has 56721 states and 197943 transitions. Word has length 54 [2018-12-09 03:40:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:50,639 INFO L480 AbstractCegarLoop]: Abstraction has 56721 states and 197943 transitions. [2018-12-09 03:40:50,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:40:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 56721 states and 197943 transitions. [2018-12-09 03:40:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 03:40:50,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:50,646 INFO L402 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] [2018-12-09 03:40:50,647 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:50,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:50,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1332981747, now seen corresponding path program 1 times [2018-12-09 03:40:50,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:50,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:50,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:50,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:50,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:50,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:50,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:40:50,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:50,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:40:50,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:40:50,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:40:50,667 INFO L87 Difference]: Start difference. First operand 56721 states and 197943 transitions. Second operand 4 states. [2018-12-09 03:40:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:50,710 INFO L93 Difference]: Finished difference Result 12705 states and 39562 transitions. [2018-12-09 03:40:50,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 03:40:50,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-09 03:40:50,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:50,723 INFO L225 Difference]: With dead ends: 12705 [2018-12-09 03:40:50,723 INFO L226 Difference]: Without dead ends: 10887 [2018-12-09 03:40:50,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-09 03:40:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-09 03:40:50,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-09 03:40:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33378 transitions. [2018-12-09 03:40:50,830 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33378 transitions. Word has length 54 [2018-12-09 03:40:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:50,830 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33378 transitions. [2018-12-09 03:40:50,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:40:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33378 transitions. [2018-12-09 03:40:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 03:40:50,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:50,832 INFO L402 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] [2018-12-09 03:40:50,832 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:50,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:50,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-09 03:40:50,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:50,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:50,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:50,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:50,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:50,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:50,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:40:50,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:50,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:40:50,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:40:50,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:40:50,866 INFO L87 Difference]: Start difference. First operand 10839 states and 33378 transitions. Second operand 4 states. [2018-12-09 03:40:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:50,940 INFO L93 Difference]: Finished difference Result 12386 states and 38207 transitions. [2018-12-09 03:40:50,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 03:40:50,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-09 03:40:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:50,955 INFO L225 Difference]: With dead ends: 12386 [2018-12-09 03:40:50,955 INFO L226 Difference]: Without dead ends: 12386 [2018-12-09 03:40:50,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-09 03:40:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-09 03:40:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-09 03:40:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 34991 transitions. [2018-12-09 03:40:51,076 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 34991 transitions. Word has length 61 [2018-12-09 03:40:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:51,076 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 34991 transitions. [2018-12-09 03:40:51,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:40:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 34991 transitions. [2018-12-09 03:40:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 03:40:51,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:51,078 INFO L402 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] [2018-12-09 03:40:51,079 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:51,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:51,079 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-09 03:40:51,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:51,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:51,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:51,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:51,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:51,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:51,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:40:51,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:51,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:40:51,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:40:51,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:40:51,119 INFO L87 Difference]: Start difference. First operand 11359 states and 34991 transitions. Second operand 6 states. [2018-12-09 03:40:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:51,352 INFO L93 Difference]: Finished difference Result 20935 states and 64392 transitions. [2018-12-09 03:40:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 03:40:51,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-09 03:40:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:51,376 INFO L225 Difference]: With dead ends: 20935 [2018-12-09 03:40:51,376 INFO L226 Difference]: Without dead ends: 20864 [2018-12-09 03:40:51,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 03:40:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-09 03:40:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-09 03:40:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-09 03:40:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40676 transitions. [2018-12-09 03:40:51,552 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40676 transitions. Word has length 61 [2018-12-09 03:40:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:51,552 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40676 transitions. [2018-12-09 03:40:51,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:40:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40676 transitions. [2018-12-09 03:40:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:40:51,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:51,557 INFO L402 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] [2018-12-09 03:40:51,557 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:51,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2018-12-09 03:40:51,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:51,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:51,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:51,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:51,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:51,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:51,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:40:51,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:51,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:40:51,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:40:51,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:40:51,577 INFO L87 Difference]: Start difference. First operand 13298 states and 40676 transitions. Second operand 3 states. [2018-12-09 03:40:51,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:51,695 INFO L93 Difference]: Finished difference Result 13930 states and 42328 transitions. [2018-12-09 03:40:51,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:40:51,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 03:40:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:51,710 INFO L225 Difference]: With dead ends: 13930 [2018-12-09 03:40:51,710 INFO L226 Difference]: Without dead ends: 13930 [2018-12-09 03:40:51,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:40:51,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-09 03:40:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-09 03:40:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-09 03:40:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41502 transitions. [2018-12-09 03:40:51,847 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41502 transitions. Word has length 67 [2018-12-09 03:40:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:51,847 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41502 transitions. [2018-12-09 03:40:51,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:40:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41502 transitions. [2018-12-09 03:40:51,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:40:51,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:51,851 INFO L402 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] [2018-12-09 03:40:51,851 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:51,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:51,852 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2018-12-09 03:40:51,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:51,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:51,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:51,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:51,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:40:51,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:51,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:40:51,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:40:51,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:40:51,895 INFO L87 Difference]: Start difference. First operand 13614 states and 41502 transitions. Second operand 4 states. [2018-12-09 03:40:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:52,070 INFO L93 Difference]: Finished difference Result 17463 states and 52707 transitions. [2018-12-09 03:40:52,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:40:52,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 03:40:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:52,089 INFO L225 Difference]: With dead ends: 17463 [2018-12-09 03:40:52,089 INFO L226 Difference]: Without dead ends: 17463 [2018-12-09 03:40:52,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:40:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-09 03:40:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-09 03:40:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-09 03:40:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46162 transitions. [2018-12-09 03:40:52,246 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46162 transitions. Word has length 67 [2018-12-09 03:40:52,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:52,247 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46162 transitions. [2018-12-09 03:40:52,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:40:52,247 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46162 transitions. [2018-12-09 03:40:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:40:52,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:52,251 INFO L402 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] [2018-12-09 03:40:52,252 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:52,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2018-12-09 03:40:52,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:52,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:52,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:52,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:52,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:52,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:52,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:40:52,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:52,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:40:52,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:40:52,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:40:52,300 INFO L87 Difference]: Start difference. First operand 15244 states and 46162 transitions. Second operand 6 states. [2018-12-09 03:40:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:52,811 INFO L93 Difference]: Finished difference Result 18862 states and 56070 transitions. [2018-12-09 03:40:52,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:40:52,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 03:40:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:52,832 INFO L225 Difference]: With dead ends: 18862 [2018-12-09 03:40:52,832 INFO L226 Difference]: Without dead ends: 18862 [2018-12-09 03:40:52,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:40:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-09 03:40:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-09 03:40:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-09 03:40:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53130 transitions. [2018-12-09 03:40:53,016 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53130 transitions. Word has length 67 [2018-12-09 03:40:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:53,016 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53130 transitions. [2018-12-09 03:40:53,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:40:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53130 transitions. [2018-12-09 03:40:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:40:53,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:53,023 INFO L402 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] [2018-12-09 03:40:53,023 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:53,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:53,023 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2018-12-09 03:40:53,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:53,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:53,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:53,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:53,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:40:53,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:53,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:40:53,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:40:53,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:40:53,086 INFO L87 Difference]: Start difference. First operand 17720 states and 53130 transitions. Second operand 6 states. [2018-12-09 03:40:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:53,347 INFO L93 Difference]: Finished difference Result 20389 states and 59192 transitions. [2018-12-09 03:40:53,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 03:40:53,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 03:40:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:53,369 INFO L225 Difference]: With dead ends: 20389 [2018-12-09 03:40:53,370 INFO L226 Difference]: Without dead ends: 20389 [2018-12-09 03:40:53,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 03:40:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-09 03:40:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-09 03:40:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-09 03:40:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53141 transitions. [2018-12-09 03:40:53,560 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53141 transitions. Word has length 67 [2018-12-09 03:40:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:53,560 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53141 transitions. [2018-12-09 03:40:53,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:40:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53141 transitions. [2018-12-09 03:40:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:40:53,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:53,568 INFO L402 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] [2018-12-09 03:40:53,568 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:53,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2018-12-09 03:40:53,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:53,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:53,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:53,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:53,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:53,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:53,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:40:53,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:53,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:40:53,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:40:53,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:53,620 INFO L87 Difference]: Start difference. First operand 18002 states and 53141 transitions. Second operand 5 states. [2018-12-09 03:40:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:53,832 INFO L93 Difference]: Finished difference Result 23413 states and 68634 transitions. [2018-12-09 03:40:53,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:40:53,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 03:40:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:53,856 INFO L225 Difference]: With dead ends: 23413 [2018-12-09 03:40:53,856 INFO L226 Difference]: Without dead ends: 23413 [2018-12-09 03:40:53,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:40:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-09 03:40:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-09 03:40:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-09 03:40:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62545 transitions. [2018-12-09 03:40:54,071 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62545 transitions. Word has length 67 [2018-12-09 03:40:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:54,071 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62545 transitions. [2018-12-09 03:40:54,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:40:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62545 transitions. [2018-12-09 03:40:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:40:54,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:54,078 INFO L402 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] [2018-12-09 03:40:54,078 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:54,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:54,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-09 03:40:54,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:54,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:54,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:54,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:54,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:54,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:54,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:40:54,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:54,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:40:54,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:40:54,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:40:54,122 INFO L87 Difference]: Start difference. First operand 21350 states and 62545 transitions. Second operand 4 states. [2018-12-09 03:40:54,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:54,485 INFO L93 Difference]: Finished difference Result 26638 states and 78155 transitions. [2018-12-09 03:40:54,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 03:40:54,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 03:40:54,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:54,515 INFO L225 Difference]: With dead ends: 26638 [2018-12-09 03:40:54,516 INFO L226 Difference]: Without dead ends: 26342 [2018-12-09 03:40:54,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26342 states. [2018-12-09 03:40:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26342 to 25026. [2018-12-09 03:40:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25026 states. [2018-12-09 03:40:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 73322 transitions. [2018-12-09 03:40:54,796 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 73322 transitions. Word has length 67 [2018-12-09 03:40:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:54,796 INFO L480 AbstractCegarLoop]: Abstraction has 25026 states and 73322 transitions. [2018-12-09 03:40:54,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:40:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 73322 transitions. [2018-12-09 03:40:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:40:54,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:54,848 INFO L402 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] [2018-12-09 03:40:54,848 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:54,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:54,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-09 03:40:54,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:54,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:54,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:54,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:54,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:40:54,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:54,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:40:54,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:40:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:54,873 INFO L87 Difference]: Start difference. First operand 25026 states and 73322 transitions. Second operand 5 states. [2018-12-09 03:40:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:54,901 INFO L93 Difference]: Finished difference Result 7314 states and 17674 transitions. [2018-12-09 03:40:54,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:40:54,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 03:40:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:54,906 INFO L225 Difference]: With dead ends: 7314 [2018-12-09 03:40:54,906 INFO L226 Difference]: Without dead ends: 6004 [2018-12-09 03:40:54,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:40:54,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2018-12-09 03:40:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5514. [2018-12-09 03:40:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5514 states. [2018-12-09 03:40:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 12848 transitions. [2018-12-09 03:40:54,946 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 12848 transitions. Word has length 67 [2018-12-09 03:40:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:54,946 INFO L480 AbstractCegarLoop]: Abstraction has 5514 states and 12848 transitions. [2018-12-09 03:40:54,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:40:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 12848 transitions. [2018-12-09 03:40:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:40:54,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:54,949 INFO L402 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] [2018-12-09 03:40:54,949 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:54,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-09 03:40:54,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:54,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:54,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:54,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:54,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:54,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:54,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:40:54,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:54,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:40:54,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:40:54,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:40:54,965 INFO L87 Difference]: Start difference. First operand 5514 states and 12848 transitions. Second operand 3 states. [2018-12-09 03:40:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:54,988 INFO L93 Difference]: Finished difference Result 7126 states and 16417 transitions. [2018-12-09 03:40:54,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:40:54,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 03:40:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:54,994 INFO L225 Difference]: With dead ends: 7126 [2018-12-09 03:40:54,994 INFO L226 Difference]: Without dead ends: 7126 [2018-12-09 03:40:54,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:40:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2018-12-09 03:40:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 5453. [2018-12-09 03:40:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2018-12-09 03:40:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 12388 transitions. [2018-12-09 03:40:55,036 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 12388 transitions. Word has length 67 [2018-12-09 03:40:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:55,037 INFO L480 AbstractCegarLoop]: Abstraction has 5453 states and 12388 transitions. [2018-12-09 03:40:55,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:40:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 12388 transitions. [2018-12-09 03:40:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 03:40:55,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:55,040 INFO L402 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] [2018-12-09 03:40:55,041 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:55,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-09 03:40:55,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:55,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:55,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:55,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:55,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:55,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:55,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:40:55,084 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:55,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:40:55,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:40:55,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:55,085 INFO L87 Difference]: Start difference. First operand 5453 states and 12388 transitions. Second operand 5 states. [2018-12-09 03:40:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:55,183 INFO L93 Difference]: Finished difference Result 6617 states and 15012 transitions. [2018-12-09 03:40:55,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 03:40:55,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-09 03:40:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:55,188 INFO L225 Difference]: With dead ends: 6617 [2018-12-09 03:40:55,188 INFO L226 Difference]: Without dead ends: 6617 [2018-12-09 03:40:55,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 03:40:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-12-09 03:40:55,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 5897. [2018-12-09 03:40:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2018-12-09 03:40:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 13392 transitions. [2018-12-09 03:40:55,229 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 13392 transitions. Word has length 73 [2018-12-09 03:40:55,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:55,230 INFO L480 AbstractCegarLoop]: Abstraction has 5897 states and 13392 transitions. [2018-12-09 03:40:55,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:40:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 13392 transitions. [2018-12-09 03:40:55,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 03:40:55,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:55,234 INFO L402 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] [2018-12-09 03:40:55,234 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:55,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:55,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-09 03:40:55,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:55,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:55,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:55,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:55,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:55,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:55,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:40:55,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:55,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:40:55,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:40:55,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:40:55,266 INFO L87 Difference]: Start difference. First operand 5897 states and 13392 transitions. Second operand 7 states. [2018-12-09 03:40:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:55,471 INFO L93 Difference]: Finished difference Result 7099 states and 15961 transitions. [2018-12-09 03:40:55,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 03:40:55,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-09 03:40:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:55,476 INFO L225 Difference]: With dead ends: 7099 [2018-12-09 03:40:55,476 INFO L226 Difference]: Without dead ends: 6980 [2018-12-09 03:40:55,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 03:40:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2018-12-09 03:40:55,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 5994. [2018-12-09 03:40:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2018-12-09 03:40:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 13485 transitions. [2018-12-09 03:40:55,521 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 13485 transitions. Word has length 73 [2018-12-09 03:40:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:55,521 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 13485 transitions. [2018-12-09 03:40:55,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:40:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 13485 transitions. [2018-12-09 03:40:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 03:40:55,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:55,525 INFO L402 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] [2018-12-09 03:40:55,526 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:55,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:55,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1678014975, now seen corresponding path program 1 times [2018-12-09 03:40:55,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:55,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:55,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:55,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:55,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:55,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:55,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:40:55,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:55,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:40:55,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:40:55,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:55,569 INFO L87 Difference]: Start difference. First operand 5994 states and 13485 transitions. Second operand 5 states. [2018-12-09 03:40:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:55,738 INFO L93 Difference]: Finished difference Result 5550 states and 12354 transitions. [2018-12-09 03:40:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:40:55,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 03:40:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:55,742 INFO L225 Difference]: With dead ends: 5550 [2018-12-09 03:40:55,742 INFO L226 Difference]: Without dead ends: 5550 [2018-12-09 03:40:55,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:40:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2018-12-09 03:40:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 5153. [2018-12-09 03:40:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2018-12-09 03:40:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 11452 transitions. [2018-12-09 03:40:55,776 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 11452 transitions. Word has length 94 [2018-12-09 03:40:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:55,776 INFO L480 AbstractCegarLoop]: Abstraction has 5153 states and 11452 transitions. [2018-12-09 03:40:55,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:40:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 11452 transitions. [2018-12-09 03:40:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 03:40:55,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:55,779 INFO L402 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] [2018-12-09 03:40:55,780 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:55,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash 612254978, now seen corresponding path program 1 times [2018-12-09 03:40:55,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:55,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:55,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:55,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:55,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:55,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:55,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:40:55,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:55,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:40:55,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:40:55,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:40:55,811 INFO L87 Difference]: Start difference. First operand 5153 states and 11452 transitions. Second operand 4 states. [2018-12-09 03:40:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:55,864 INFO L93 Difference]: Finished difference Result 6337 states and 14007 transitions. [2018-12-09 03:40:55,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:40:55,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 03:40:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:55,868 INFO L225 Difference]: With dead ends: 6337 [2018-12-09 03:40:55,868 INFO L226 Difference]: Without dead ends: 6337 [2018-12-09 03:40:55,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2018-12-09 03:40:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 5568. [2018-12-09 03:40:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5568 states. [2018-12-09 03:40:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5568 states to 5568 states and 12373 transitions. [2018-12-09 03:40:55,911 INFO L78 Accepts]: Start accepts. Automaton has 5568 states and 12373 transitions. Word has length 94 [2018-12-09 03:40:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:55,911 INFO L480 AbstractCegarLoop]: Abstraction has 5568 states and 12373 transitions. [2018-12-09 03:40:55,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:40:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 5568 states and 12373 transitions. [2018-12-09 03:40:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:40:55,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:55,915 INFO L402 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] [2018-12-09 03:40:55,916 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:55,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1661573399, now seen corresponding path program 1 times [2018-12-09 03:40:55,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:55,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:55,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:55,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:55,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:55,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:55,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:40:55,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:55,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:40:55,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:40:55,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:40:55,955 INFO L87 Difference]: Start difference. First operand 5568 states and 12373 transitions. Second operand 5 states. [2018-12-09 03:40:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:56,033 INFO L93 Difference]: Finished difference Result 6441 states and 14301 transitions. [2018-12-09 03:40:56,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:40:56,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 03:40:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:56,037 INFO L225 Difference]: With dead ends: 6441 [2018-12-09 03:40:56,037 INFO L226 Difference]: Without dead ends: 6441 [2018-12-09 03:40:56,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:40:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2018-12-09 03:40:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5079. [2018-12-09 03:40:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5079 states. [2018-12-09 03:40:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 11282 transitions. [2018-12-09 03:40:56,076 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 11282 transitions. Word has length 96 [2018-12-09 03:40:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:56,076 INFO L480 AbstractCegarLoop]: Abstraction has 5079 states and 11282 transitions. [2018-12-09 03:40:56,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:40:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 11282 transitions. [2018-12-09 03:40:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:40:56,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:56,079 INFO L402 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] [2018-12-09 03:40:56,080 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:56,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:56,080 INFO L82 PathProgramCache]: Analyzing trace with hash -28769400, now seen corresponding path program 1 times [2018-12-09 03:40:56,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:56,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:56,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:56,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:56,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:56,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:56,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:40:56,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:56,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:40:56,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:40:56,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:40:56,163 INFO L87 Difference]: Start difference. First operand 5079 states and 11282 transitions. Second operand 7 states. [2018-12-09 03:40:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:56,344 INFO L93 Difference]: Finished difference Result 6777 states and 14905 transitions. [2018-12-09 03:40:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 03:40:56,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 03:40:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:56,349 INFO L225 Difference]: With dead ends: 6777 [2018-12-09 03:40:56,349 INFO L226 Difference]: Without dead ends: 6723 [2018-12-09 03:40:56,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 03:40:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6723 states. [2018-12-09 03:40:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6723 to 5556. [2018-12-09 03:40:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5556 states. [2018-12-09 03:40:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 12272 transitions. [2018-12-09 03:40:56,389 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 12272 transitions. Word has length 96 [2018-12-09 03:40:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:56,389 INFO L480 AbstractCegarLoop]: Abstraction has 5556 states and 12272 transitions. [2018-12-09 03:40:56,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:40:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 12272 transitions. [2018-12-09 03:40:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:40:56,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:56,392 INFO L402 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] [2018-12-09 03:40:56,392 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:56,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1976450999, now seen corresponding path program 1 times [2018-12-09 03:40:56,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:56,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:56,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:56,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:56,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:56,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:56,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:40:56,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:56,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:40:56,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:40:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:40:56,444 INFO L87 Difference]: Start difference. First operand 5556 states and 12272 transitions. Second operand 6 states. [2018-12-09 03:40:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:56,646 INFO L93 Difference]: Finished difference Result 6493 states and 14426 transitions. [2018-12-09 03:40:56,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:40:56,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 03:40:56,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:56,650 INFO L225 Difference]: With dead ends: 6493 [2018-12-09 03:40:56,650 INFO L226 Difference]: Without dead ends: 6493 [2018-12-09 03:40:56,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:40:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6493 states. [2018-12-09 03:40:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6493 to 5763. [2018-12-09 03:40:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5763 states. [2018-12-09 03:40:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 12725 transitions. [2018-12-09 03:40:56,690 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 12725 transitions. Word has length 96 [2018-12-09 03:40:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:56,690 INFO L480 AbstractCegarLoop]: Abstraction has 5763 states and 12725 transitions. [2018-12-09 03:40:56,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:40:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 12725 transitions. [2018-12-09 03:40:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:40:56,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:56,694 INFO L402 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] [2018-12-09 03:40:56,694 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:56,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:56,694 INFO L82 PathProgramCache]: Analyzing trace with hash 400392135, now seen corresponding path program 1 times [2018-12-09 03:40:56,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:56,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:56,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:56,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:56,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:56,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:56,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:40:56,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:56,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:40:56,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:40:56,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:40:56,742 INFO L87 Difference]: Start difference. First operand 5763 states and 12725 transitions. Second operand 6 states. [2018-12-09 03:40:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:57,043 INFO L93 Difference]: Finished difference Result 7787 states and 17066 transitions. [2018-12-09 03:40:57,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 03:40:57,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 03:40:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:57,048 INFO L225 Difference]: With dead ends: 7787 [2018-12-09 03:40:57,048 INFO L226 Difference]: Without dead ends: 7771 [2018-12-09 03:40:57,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-09 03:40:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2018-12-09 03:40:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 6210. [2018-12-09 03:40:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2018-12-09 03:40:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 13818 transitions. [2018-12-09 03:40:57,095 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 13818 transitions. Word has length 96 [2018-12-09 03:40:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:57,096 INFO L480 AbstractCegarLoop]: Abstraction has 6210 states and 13818 transitions. [2018-12-09 03:40:57,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:40:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 13818 transitions. [2018-12-09 03:40:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:40:57,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:57,099 INFO L402 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] [2018-12-09 03:40:57,100 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:57,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:57,100 INFO L82 PathProgramCache]: Analyzing trace with hash 611743048, now seen corresponding path program 1 times [2018-12-09 03:40:57,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:57,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:57,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:57,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:57,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:57,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:57,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:40:57,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:57,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:40:57,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:40:57,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:40:57,161 INFO L87 Difference]: Start difference. First operand 6210 states and 13818 transitions. Second operand 6 states. [2018-12-09 03:40:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:57,268 INFO L93 Difference]: Finished difference Result 6536 states and 14293 transitions. [2018-12-09 03:40:57,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:40:57,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 03:40:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:57,272 INFO L225 Difference]: With dead ends: 6536 [2018-12-09 03:40:57,272 INFO L226 Difference]: Without dead ends: 6514 [2018-12-09 03:40:57,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:40:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2018-12-09 03:40:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 5548. [2018-12-09 03:40:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5548 states. [2018-12-09 03:40:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5548 states to 5548 states and 12250 transitions. [2018-12-09 03:40:57,311 INFO L78 Accepts]: Start accepts. Automaton has 5548 states and 12250 transitions. Word has length 96 [2018-12-09 03:40:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:57,311 INFO L480 AbstractCegarLoop]: Abstraction has 5548 states and 12250 transitions. [2018-12-09 03:40:57,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:40:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5548 states and 12250 transitions. [2018-12-09 03:40:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:40:57,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:57,315 INFO L402 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] [2018-12-09 03:40:57,315 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:57,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:57,315 INFO L82 PathProgramCache]: Analyzing trace with hash -893987928, now seen corresponding path program 1 times [2018-12-09 03:40:57,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:57,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:57,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:57,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:57,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:57,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:57,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 03:40:57,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:57,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 03:40:57,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 03:40:57,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 03:40:57,425 INFO L87 Difference]: Start difference. First operand 5548 states and 12250 transitions. Second operand 9 states. [2018-12-09 03:40:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:57,796 INFO L93 Difference]: Finished difference Result 6597 states and 14375 transitions. [2018-12-09 03:40:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 03:40:57,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-09 03:40:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:57,800 INFO L225 Difference]: With dead ends: 6597 [2018-12-09 03:40:57,801 INFO L226 Difference]: Without dead ends: 6597 [2018-12-09 03:40:57,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-09 03:40:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2018-12-09 03:40:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 5852. [2018-12-09 03:40:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5852 states. [2018-12-09 03:40:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 12874 transitions. [2018-12-09 03:40:57,845 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 12874 transitions. Word has length 96 [2018-12-09 03:40:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:57,845 INFO L480 AbstractCegarLoop]: Abstraction has 5852 states and 12874 transitions. [2018-12-09 03:40:57,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 03:40:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 12874 transitions. [2018-12-09 03:40:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:40:57,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:57,849 INFO L402 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] [2018-12-09 03:40:57,849 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:57,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash 273485737, now seen corresponding path program 1 times [2018-12-09 03:40:57,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:57,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:57,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:57,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:57,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:57,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:57,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:40:57,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:57,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:40:57,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:40:57,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:40:57,896 INFO L87 Difference]: Start difference. First operand 5852 states and 12874 transitions. Second operand 7 states. [2018-12-09 03:40:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:58,094 INFO L93 Difference]: Finished difference Result 7331 states and 16051 transitions. [2018-12-09 03:40:58,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 03:40:58,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 03:40:58,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:58,099 INFO L225 Difference]: With dead ends: 7331 [2018-12-09 03:40:58,099 INFO L226 Difference]: Without dead ends: 7331 [2018-12-09 03:40:58,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 03:40:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2018-12-09 03:40:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 6796. [2018-12-09 03:40:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6796 states. [2018-12-09 03:40:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6796 states to 6796 states and 14856 transitions. [2018-12-09 03:40:58,148 INFO L78 Accepts]: Start accepts. Automaton has 6796 states and 14856 transitions. Word has length 96 [2018-12-09 03:40:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:58,148 INFO L480 AbstractCegarLoop]: Abstraction has 6796 states and 14856 transitions. [2018-12-09 03:40:58,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:40:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6796 states and 14856 transitions. [2018-12-09 03:40:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:40:58,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:58,153 INFO L402 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] [2018-12-09 03:40:58,153 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:58,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:58,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2033999799, now seen corresponding path program 1 times [2018-12-09 03:40:58,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:58,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:58,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:58,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:58,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:40:58,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:58,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:40:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:40:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:40:58,218 INFO L87 Difference]: Start difference. First operand 6796 states and 14856 transitions. Second operand 7 states. [2018-12-09 03:40:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:58,309 INFO L93 Difference]: Finished difference Result 8554 states and 18799 transitions. [2018-12-09 03:40:58,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:40:58,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 03:40:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:58,315 INFO L225 Difference]: With dead ends: 8554 [2018-12-09 03:40:58,315 INFO L226 Difference]: Without dead ends: 8554 [2018-12-09 03:40:58,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 03:40:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8554 states. [2018-12-09 03:40:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8554 to 6128. [2018-12-09 03:40:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6128 states. [2018-12-09 03:40:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6128 states to 6128 states and 13324 transitions. [2018-12-09 03:40:58,363 INFO L78 Accepts]: Start accepts. Automaton has 6128 states and 13324 transitions. Word has length 96 [2018-12-09 03:40:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:58,364 INFO L480 AbstractCegarLoop]: Abstraction has 6128 states and 13324 transitions. [2018-12-09 03:40:58,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:40:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 6128 states and 13324 transitions. [2018-12-09 03:40:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:40:58,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:58,368 INFO L402 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] [2018-12-09 03:40:58,368 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:58,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash -205542070, now seen corresponding path program 1 times [2018-12-09 03:40:58,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:58,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:58,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:58,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:58,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:58,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 03:40:58,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:58,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 03:40:58,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 03:40:58,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-09 03:40:58,457 INFO L87 Difference]: Start difference. First operand 6128 states and 13324 transitions. Second operand 11 states. [2018-12-09 03:40:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:40:58,845 INFO L93 Difference]: Finished difference Result 7681 states and 16682 transitions. [2018-12-09 03:40:58,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 03:40:58,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 03:40:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:40:58,851 INFO L225 Difference]: With dead ends: 7681 [2018-12-09 03:40:58,851 INFO L226 Difference]: Without dead ends: 7681 [2018-12-09 03:40:58,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-12-09 03:40:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7681 states. [2018-12-09 03:40:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7681 to 6402. [2018-12-09 03:40:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6402 states. [2018-12-09 03:40:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 13959 transitions. [2018-12-09 03:40:58,899 INFO L78 Accepts]: Start accepts. Automaton has 6402 states and 13959 transitions. Word has length 96 [2018-12-09 03:40:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:40:58,899 INFO L480 AbstractCegarLoop]: Abstraction has 6402 states and 13959 transitions. [2018-12-09 03:40:58,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 03:40:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 6402 states and 13959 transitions. [2018-12-09 03:40:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:40:58,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:40:58,903 INFO L402 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] [2018-12-09 03:40:58,904 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:40:58,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:40:58,904 INFO L82 PathProgramCache]: Analyzing trace with hash 681961611, now seen corresponding path program 1 times [2018-12-09 03:40:58,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:40:58,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:58,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:40:58,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:40:58,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:40:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:40:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:40:59,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:40:59,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 03:40:59,004 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:40:59,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 03:40:59,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 03:40:59,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 03:40:59,005 INFO L87 Difference]: Start difference. First operand 6402 states and 13959 transitions. Second operand 11 states. [2018-12-09 03:41:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:41:00,327 INFO L93 Difference]: Finished difference Result 12306 states and 27186 transitions. [2018-12-09 03:41:00,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 03:41:00,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 03:41:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:41:00,333 INFO L225 Difference]: With dead ends: 12306 [2018-12-09 03:41:00,333 INFO L226 Difference]: Without dead ends: 7693 [2018-12-09 03:41:00,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 03:41:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7693 states. [2018-12-09 03:41:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7693 to 5578. [2018-12-09 03:41:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5578 states. [2018-12-09 03:41:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5578 states to 5578 states and 12198 transitions. [2018-12-09 03:41:00,377 INFO L78 Accepts]: Start accepts. Automaton has 5578 states and 12198 transitions. Word has length 96 [2018-12-09 03:41:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:41:00,377 INFO L480 AbstractCegarLoop]: Abstraction has 5578 states and 12198 transitions. [2018-12-09 03:41:00,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 03:41:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5578 states and 12198 transitions. [2018-12-09 03:41:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:41:00,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:41:00,381 INFO L402 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] [2018-12-09 03:41:00,381 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:41:00,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:41:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash -575911691, now seen corresponding path program 2 times [2018-12-09 03:41:00,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:41:00,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:41:00,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:41:00,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:41:00,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:41:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:41:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:41:00,418 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 03:41:00,487 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 03:41:00,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:41:00 BasicIcfg [2018-12-09 03:41:00,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 03:41:00,488 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 03:41:00,488 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 03:41:00,488 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 03:41:00,489 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:40:32" (3/4) ... [2018-12-09 03:41:00,491 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 03:41:00,561 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_621d1f50-7e74-4eb3-8c3f-14b12b6ee68f/bin-2019/utaipan/witness.graphml [2018-12-09 03:41:00,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 03:41:00,562 INFO L168 Benchmark]: Toolchain (without parser) took 28318.92 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -56.1 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2018-12-09 03:41:00,563 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:41:00,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2018-12-09 03:41:00,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 03:41:00,564 INFO L168 Benchmark]: Boogie Preprocessor took 20.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:41:00,564 INFO L168 Benchmark]: RCFGBuilder took 315.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-09 03:41:00,564 INFO L168 Benchmark]: TraceAbstraction took 27506.47 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -19.6 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-09 03:41:00,564 INFO L168 Benchmark]: Witness Printer took 73.42 ms. Allocated memory is still 4.0 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2018-12-09 03:41:00,566 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 315.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27506.47 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -19.6 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 73.42 ms. Allocated memory is still 4.0 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t315; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t316; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 27.4s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9286 SDtfs, 10544 SDslu, 21235 SDs, 0 SdLazy, 9348 SolverSat, 488 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 85 SyntacticMatches, 33 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 183957 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2544 NumberOfCodeBlocks, 2544 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2414 ConstructedInterpolants, 0 QuantifiedInterpolants, 589910 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...