./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_tso.opt_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_1befb778-87ee-47ee-8886-3cb1c1ebb086/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/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 5e09268fb712cd64b95667f17ecc6d5ef1ed6f24 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:51:54,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:51:54,468 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:51:54,474 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:51:54,474 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:51:54,474 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:51:54,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:51:54,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:51:54,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:51:54,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:51:54,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:51:54,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:51:54,478 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:51:54,479 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:51:54,479 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:51:54,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:51:54,480 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:51:54,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:51:54,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:51:54,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:51:54,483 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:51:54,484 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:51:54,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:51:54,485 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:51:54,485 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:51:54,486 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:51:54,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:51:54,486 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:51:54,487 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:51:54,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:51:54,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:51:54,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:51:54,488 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:51:54,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:51:54,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:51:54,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:51:54,489 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 12:51:54,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:51:54,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:51:54,497 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:51:54,497 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:51:54,497 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:51:54,497 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:51:54,497 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:51:54,497 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:51:54,497 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:51:54,497 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:51:54,497 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:51:54,497 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:51:54,498 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:51:54,498 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:51:54,498 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:51:54,498 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:51:54,498 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:51:54,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:51:54,498 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:51:54,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:51:54,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:51:54,499 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:51:54,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:51:54,499 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:51:54,499 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:51:54,499 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:51:54,499 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:51:54,499 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:51:54,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:51:54,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:51:54,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:51:54,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:51:54,499 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:51:54,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:51:54,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:51:54,500 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 12:51:54,500 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_1befb778-87ee-47ee-8886-3cb1c1ebb086/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 -> 5e09268fb712cd64b95667f17ecc6d5ef1ed6f24 [2018-12-09 12:51:54,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:51:54,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:51:54,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:51:54,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:51:54,529 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:51:54,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix042_tso.opt_false-unreach-call.i [2018-12-09 12:51:54,563 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/bin-2019/utaipan/data/6529591eb/cdb7262bf283440d9c87fa4d12a9b3be/FLAG36ac045b9 [2018-12-09 12:51:55,011 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:51:55,011 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/sv-benchmarks/c/pthread-wmm/mix042_tso.opt_false-unreach-call.i [2018-12-09 12:51:55,019 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/bin-2019/utaipan/data/6529591eb/cdb7262bf283440d9c87fa4d12a9b3be/FLAG36ac045b9 [2018-12-09 12:51:55,027 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/bin-2019/utaipan/data/6529591eb/cdb7262bf283440d9c87fa4d12a9b3be [2018-12-09 12:51:55,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:51:55,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:51:55,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:51:55,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:51:55,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:51:55,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:51:55" (1/1) ... [2018-12-09 12:51:55,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55, skipping insertion in model container [2018-12-09 12:51:55,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:51:55" (1/1) ... [2018-12-09 12:51:55,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:51:55,060 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:51:55,238 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:51:55,246 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:51:55,330 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:51:55,377 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:51:55,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55 WrapperNode [2018-12-09 12:51:55,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:51:55,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:51:55,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:51:55,378 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:51:55,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55" (1/1) ... [2018-12-09 12:51:55,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55" (1/1) ... [2018-12-09 12:51:55,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:51:55,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:51:55,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:51:55,418 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:51:55,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55" (1/1) ... [2018-12-09 12:51:55,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55" (1/1) ... [2018-12-09 12:51:55,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55" (1/1) ... [2018-12-09 12:51:55,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55" (1/1) ... [2018-12-09 12:51:55,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55" (1/1) ... [2018-12-09 12:51:55,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55" (1/1) ... [2018-12-09 12:51:55,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55" (1/1) ... [2018-12-09 12:51:55,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:51:55,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:51:55,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:51:55,438 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:51:55,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/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 12:51:55,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:51:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:51:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 12:51:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:51:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 12:51:55,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 12:51:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 12:51:55,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 12:51:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 12:51:55,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 12:51:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 12:51:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:51:55,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:51:55,473 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 12:51:55,792 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:51:55,792 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 12:51:55,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:51:55 BoogieIcfgContainer [2018-12-09 12:51:55,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:51:55,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:51:55,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:51:55,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:51:55,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:51:55" (1/3) ... [2018-12-09 12:51:55,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c378619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:51:55, skipping insertion in model container [2018-12-09 12:51:55,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:51:55" (2/3) ... [2018-12-09 12:51:55,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c378619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:51:55, skipping insertion in model container [2018-12-09 12:51:55,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:51:55" (3/3) ... [2018-12-09 12:51:55,799 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt_false-unreach-call.i [2018-12-09 12:51:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,824 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,824 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,825 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,825 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,829 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,829 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,829 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,829 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,829 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:51:55,836 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 12:51:55,836 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:51:55,841 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 12:51:55,851 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 12:51:55,866 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:51:55,866 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:51:55,866 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:51:55,866 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:51:55,866 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:51:55,866 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:51:55,866 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:51:55,866 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:51:55,873 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158places, 195 transitions [2018-12-09 12:52:08,972 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128915 states. [2018-12-09 12:52:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 128915 states. [2018-12-09 12:52:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 12:52:08,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:52:08,981 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 12:52:08,982 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:52:08,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:52:08,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1862294190, now seen corresponding path program 1 times [2018-12-09 12:52:08,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:52:09,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:09,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:52:09,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:09,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:52:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:09,152 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 12:52:09,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:52:09,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:52:09,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:52:09,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:52:09,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:52:09,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:52:09,167 INFO L87 Difference]: Start difference. First operand 128915 states. Second operand 4 states. [2018-12-09 12:52:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:52:10,435 INFO L93 Difference]: Finished difference Result 233475 states and 1098327 transitions. [2018-12-09 12:52:10,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:52:10,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-09 12:52:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:52:11,208 INFO L225 Difference]: With dead ends: 233475 [2018-12-09 12:52:11,208 INFO L226 Difference]: Without dead ends: 203725 [2018-12-09 12:52:11,209 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 12:52:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203725 states. [2018-12-09 12:52:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203725 to 118895. [2018-12-09 12:52:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-09 12:52:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 559778 transitions. [2018-12-09 12:52:16,279 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 559778 transitions. Word has length 46 [2018-12-09 12:52:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:52:16,280 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 559778 transitions. [2018-12-09 12:52:16,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:52:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 559778 transitions. [2018-12-09 12:52:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 12:52:16,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:52:16,287 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 12:52:16,287 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:52:16,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:52:16,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1986059105, now seen corresponding path program 1 times [2018-12-09 12:52:16,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:52:16,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:16,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:52:16,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:16,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:52:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:16,325 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 12:52:16,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:52:16,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:52:16,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:52:16,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:52:16,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:52:16,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:52:16,327 INFO L87 Difference]: Start difference. First operand 118895 states and 559778 transitions. Second operand 3 states. [2018-12-09 12:52:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:52:16,882 INFO L93 Difference]: Finished difference Result 118895 states and 557818 transitions. [2018-12-09 12:52:16,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:52:16,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-09 12:52:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:52:17,634 INFO L225 Difference]: With dead ends: 118895 [2018-12-09 12:52:17,634 INFO L226 Difference]: Without dead ends: 118895 [2018-12-09 12:52:17,635 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 12:52:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118895 states. [2018-12-09 12:52:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118895 to 118895. [2018-12-09 12:52:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-09 12:52:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 557818 transitions. [2018-12-09 12:52:21,988 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 557818 transitions. Word has length 53 [2018-12-09 12:52:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:52:21,988 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 557818 transitions. [2018-12-09 12:52:21,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:52:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 557818 transitions. [2018-12-09 12:52:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 12:52:21,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:52:21,992 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 12:52:21,992 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:52:21,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:52:21,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1856976386, now seen corresponding path program 1 times [2018-12-09 12:52:21,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:52:21,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:21,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:52:21,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:21,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:52:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:22,043 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 12:52:22,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:52:22,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:52:22,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:52:22,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:52:22,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:52:22,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:52:22,044 INFO L87 Difference]: Start difference. First operand 118895 states and 557818 transitions. Second operand 5 states. [2018-12-09 12:52:23,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:52:23,737 INFO L93 Difference]: Finished difference Result 325275 states and 1468252 transitions. [2018-12-09 12:52:23,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:52:23,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-09 12:52:23,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:52:24,640 INFO L225 Difference]: With dead ends: 325275 [2018-12-09 12:52:24,641 INFO L226 Difference]: Without dead ends: 324275 [2018-12-09 12:52:24,641 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 12:52:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324275 states. [2018-12-09 12:52:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324275 to 186425. [2018-12-09 12:52:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186425 states. [2018-12-09 12:52:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186425 states to 186425 states and 840917 transitions. [2018-12-09 12:52:29,745 INFO L78 Accepts]: Start accepts. Automaton has 186425 states and 840917 transitions. Word has length 53 [2018-12-09 12:52:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:52:29,745 INFO L480 AbstractCegarLoop]: Abstraction has 186425 states and 840917 transitions. [2018-12-09 12:52:29,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:52:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 186425 states and 840917 transitions. [2018-12-09 12:52:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 12:52:29,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:52:29,752 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 12:52:29,752 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:52:29,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:52:29,752 INFO L82 PathProgramCache]: Analyzing trace with hash 713101365, now seen corresponding path program 1 times [2018-12-09 12:52:29,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:52:29,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:29,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:52:29,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:29,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:52:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:29,802 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 12:52:29,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:52:29,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:52:29,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:52:29,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:52:29,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:52:29,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:52:29,803 INFO L87 Difference]: Start difference. First operand 186425 states and 840917 transitions. Second operand 5 states. [2018-12-09 12:52:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:52:31,486 INFO L93 Difference]: Finished difference Result 334055 states and 1500996 transitions. [2018-12-09 12:52:31,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:52:31,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-09 12:52:31,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:52:35,231 INFO L225 Difference]: With dead ends: 334055 [2018-12-09 12:52:35,232 INFO L226 Difference]: Without dead ends: 333005 [2018-12-09 12:52:35,232 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 12:52:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333005 states. [2018-12-09 12:52:39,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333005 to 194885. [2018-12-09 12:52:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194885 states. [2018-12-09 12:52:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194885 states to 194885 states and 876475 transitions. [2018-12-09 12:52:39,921 INFO L78 Accepts]: Start accepts. Automaton has 194885 states and 876475 transitions. Word has length 54 [2018-12-09 12:52:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:52:39,921 INFO L480 AbstractCegarLoop]: Abstraction has 194885 states and 876475 transitions. [2018-12-09 12:52:39,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:52:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 194885 states and 876475 transitions. [2018-12-09 12:52:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 12:52:39,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:52:39,944 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 12:52:39,945 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:52:39,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:52:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1926060511, now seen corresponding path program 1 times [2018-12-09 12:52:39,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:52:39,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:39,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:52:39,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:39,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:52:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:39,991 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 12:52:39,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:52:39,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:52:39,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:52:39,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:52:39,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:52:39,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:52:39,992 INFO L87 Difference]: Start difference. First operand 194885 states and 876475 transitions. Second operand 3 states. [2018-12-09 12:52:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:52:41,234 INFO L93 Difference]: Finished difference Result 194885 states and 876430 transitions. [2018-12-09 12:52:41,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:52:41,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-12-09 12:52:41,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:52:41,755 INFO L225 Difference]: With dead ends: 194885 [2018-12-09 12:52:41,755 INFO L226 Difference]: Without dead ends: 194885 [2018-12-09 12:52:41,755 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 12:52:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194885 states. [2018-12-09 12:52:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194885 to 194885. [2018-12-09 12:52:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194885 states. [2018-12-09 12:52:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194885 states to 194885 states and 876430 transitions. [2018-12-09 12:52:48,493 INFO L78 Accepts]: Start accepts. Automaton has 194885 states and 876430 transitions. Word has length 61 [2018-12-09 12:52:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:52:48,493 INFO L480 AbstractCegarLoop]: Abstraction has 194885 states and 876430 transitions. [2018-12-09 12:52:48,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:52:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 194885 states and 876430 transitions. [2018-12-09 12:52:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 12:52:48,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:52:48,515 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 12:52:48,515 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:52:48,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:52:48,515 INFO L82 PathProgramCache]: Analyzing trace with hash -183250176, now seen corresponding path program 1 times [2018-12-09 12:52:48,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:52:48,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:48,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:52:48,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:48,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:52:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:48,565 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 12:52:48,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:52:48,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:52:48,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:52:48,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:52:48,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:52:48,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:52:48,565 INFO L87 Difference]: Start difference. First operand 194885 states and 876430 transitions. Second operand 6 states. [2018-12-09 12:52:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:52:50,788 INFO L93 Difference]: Finished difference Result 342295 states and 1509933 transitions. [2018-12-09 12:52:50,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:52:50,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-09 12:52:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:52:51,698 INFO L225 Difference]: With dead ends: 342295 [2018-12-09 12:52:51,698 INFO L226 Difference]: Without dead ends: 341295 [2018-12-09 12:52:51,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-09 12:52:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341295 states. [2018-12-09 12:52:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341295 to 189135. [2018-12-09 12:52:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189135 states. [2018-12-09 12:52:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189135 states to 189135 states and 850630 transitions. [2018-12-09 12:52:57,138 INFO L78 Accepts]: Start accepts. Automaton has 189135 states and 850630 transitions. Word has length 61 [2018-12-09 12:52:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:52:57,138 INFO L480 AbstractCegarLoop]: Abstraction has 189135 states and 850630 transitions. [2018-12-09 12:52:57,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:52:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 189135 states and 850630 transitions. [2018-12-09 12:52:57,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 12:52:57,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:52:57,205 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] [2018-12-09 12:52:57,206 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:52:57,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:52:57,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1250958823, now seen corresponding path program 1 times [2018-12-09 12:52:57,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:52:57,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:57,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:52:57,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:57,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:52:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:57,257 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 12:52:57,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:52:57,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:52:57,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:52:57,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:52:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:52:57,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:52:57,258 INFO L87 Difference]: Start difference. First operand 189135 states and 850630 transitions. Second operand 6 states. [2018-12-09 12:53:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:01,712 INFO L93 Difference]: Finished difference Result 402825 states and 1786032 transitions. [2018-12-09 12:53:01,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 12:53:01,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 12:53:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:02,887 INFO L225 Difference]: With dead ends: 402825 [2018-12-09 12:53:02,887 INFO L226 Difference]: Without dead ends: 401225 [2018-12-09 12:53:02,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:53:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401225 states. [2018-12-09 12:53:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401225 to 224570. [2018-12-09 12:53:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224570 states. [2018-12-09 12:53:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224570 states to 224570 states and 1000348 transitions. [2018-12-09 12:53:08,851 INFO L78 Accepts]: Start accepts. Automaton has 224570 states and 1000348 transitions. Word has length 68 [2018-12-09 12:53:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:08,851 INFO L480 AbstractCegarLoop]: Abstraction has 224570 states and 1000348 transitions. [2018-12-09 12:53:08,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:53:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 224570 states and 1000348 transitions. [2018-12-09 12:53:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 12:53:08,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:08,945 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] [2018-12-09 12:53:08,945 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:08,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash 587746263, now seen corresponding path program 1 times [2018-12-09 12:53:08,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:53:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:08,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:08,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:53:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:08,981 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 12:53:08,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:08,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:53:08,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:53:08,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:53:08,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:53:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:53:08,983 INFO L87 Difference]: Start difference. First operand 224570 states and 1000348 transitions. Second operand 3 states. [2018-12-09 12:53:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:10,647 INFO L93 Difference]: Finished difference Result 283190 states and 1243374 transitions. [2018-12-09 12:53:10,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:53:10,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-09 12:53:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:11,389 INFO L225 Difference]: With dead ends: 283190 [2018-12-09 12:53:11,389 INFO L226 Difference]: Without dead ends: 283190 [2018-12-09 12:53:11,389 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 12:53:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283190 states. [2018-12-09 12:53:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283190 to 245735. [2018-12-09 12:53:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245735 states. [2018-12-09 12:53:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245735 states to 245735 states and 1089140 transitions. [2018-12-09 12:53:19,612 INFO L78 Accepts]: Start accepts. Automaton has 245735 states and 1089140 transitions. Word has length 70 [2018-12-09 12:53:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:19,612 INFO L480 AbstractCegarLoop]: Abstraction has 245735 states and 1089140 transitions. [2018-12-09 12:53:19,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:53:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 245735 states and 1089140 transitions. [2018-12-09 12:53:19,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 12:53:19,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:19,745 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] [2018-12-09 12:53:19,746 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:19,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:19,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1385046795, now seen corresponding path program 1 times [2018-12-09 12:53:19,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:53:19,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:19,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:19,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:19,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:53:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:19,809 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 12:53:19,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:19,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:53:19,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:53:19,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:53:19,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:53:19,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:19,810 INFO L87 Difference]: Start difference. First operand 245735 states and 1089140 transitions. Second operand 7 states. [2018-12-09 12:53:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:22,693 INFO L93 Difference]: Finished difference Result 448855 states and 1963116 transitions. [2018-12-09 12:53:22,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 12:53:22,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 12:53:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:24,608 INFO L225 Difference]: With dead ends: 448855 [2018-12-09 12:53:24,609 INFO L226 Difference]: Without dead ends: 447255 [2018-12-09 12:53:24,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-09 12:53:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447255 states. [2018-12-09 12:53:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447255 to 253355. [2018-12-09 12:53:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253355 states. [2018-12-09 12:53:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253355 states to 253355 states and 1121646 transitions. [2018-12-09 12:53:31,560 INFO L78 Accepts]: Start accepts. Automaton has 253355 states and 1121646 transitions. Word has length 74 [2018-12-09 12:53:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:31,560 INFO L480 AbstractCegarLoop]: Abstraction has 253355 states and 1121646 transitions. [2018-12-09 12:53:31,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:53:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 253355 states and 1121646 transitions. [2018-12-09 12:53:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 12:53:31,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:31,706 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] [2018-12-09 12:53:31,706 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:31,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:31,707 INFO L82 PathProgramCache]: Analyzing trace with hash 782165715, now seen corresponding path program 1 times [2018-12-09 12:53:31,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:53:31,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:31,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:31,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:31,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:53:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:31,744 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 12:53:31,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:31,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:53:31,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:53:31,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:53:31,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:53:31,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:53:31,745 INFO L87 Difference]: Start difference. First operand 253355 states and 1121646 transitions. Second operand 4 states. [2018-12-09 12:53:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:36,065 INFO L93 Difference]: Finished difference Result 378280 states and 1665596 transitions. [2018-12-09 12:53:36,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:53:36,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-09 12:53:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:37,419 INFO L225 Difference]: With dead ends: 378280 [2018-12-09 12:53:37,419 INFO L226 Difference]: Without dead ends: 375320 [2018-12-09 12:53:37,419 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 12:53:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375320 states. [2018-12-09 12:53:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375320 to 317205. [2018-12-09 12:53:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317205 states. [2018-12-09 12:53:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317205 states to 317205 states and 1406261 transitions. [2018-12-09 12:53:44,440 INFO L78 Accepts]: Start accepts. Automaton has 317205 states and 1406261 transitions. Word has length 75 [2018-12-09 12:53:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:44,441 INFO L480 AbstractCegarLoop]: Abstraction has 317205 states and 1406261 transitions. [2018-12-09 12:53:44,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:53:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 317205 states and 1406261 transitions. [2018-12-09 12:53:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 12:53:44,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:44,669 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] [2018-12-09 12:53:44,669 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:44,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2135475412, now seen corresponding path program 1 times [2018-12-09 12:53:44,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:53:44,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:44,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:44,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:44,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:53:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:44,716 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 12:53:44,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:44,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:53:44,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:53:44,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:53:44,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:53:44,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:44,717 INFO L87 Difference]: Start difference. First operand 317205 states and 1406261 transitions. Second operand 7 states. [2018-12-09 12:53:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:47,905 INFO L93 Difference]: Finished difference Result 455310 states and 2000550 transitions. [2018-12-09 12:53:47,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 12:53:47,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-09 12:53:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:49,669 INFO L225 Difference]: With dead ends: 455310 [2018-12-09 12:53:49,670 INFO L226 Difference]: Without dead ends: 453960 [2018-12-09 12:53:49,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-09 12:53:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453960 states. [2018-12-09 12:54:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453960 to 321680. [2018-12-09 12:54:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321680 states. [2018-12-09 12:54:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321680 states to 321680 states and 1424261 transitions. [2018-12-09 12:54:01,578 INFO L78 Accepts]: Start accepts. Automaton has 321680 states and 1424261 transitions. Word has length 75 [2018-12-09 12:54:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:54:01,578 INFO L480 AbstractCegarLoop]: Abstraction has 321680 states and 1424261 transitions. [2018-12-09 12:54:01,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:54:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 321680 states and 1424261 transitions. [2018-12-09 12:54:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 12:54:01,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:54:01,842 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] [2018-12-09 12:54:01,842 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:54:01,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:54:01,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1218293327, now seen corresponding path program 1 times [2018-12-09 12:54:01,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:54:01,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:01,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:54:01,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:01,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:54:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:54:01,903 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 12:54:01,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:54:01,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:54:01,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:54:01,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:54:01,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:54:01,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:54:01,904 INFO L87 Difference]: Start difference. First operand 321680 states and 1424261 transitions. Second operand 6 states. [2018-12-09 12:54:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:54:04,624 INFO L93 Difference]: Finished difference Result 397725 states and 1743892 transitions. [2018-12-09 12:54:04,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:54:04,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-09 12:54:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:54:05,749 INFO L225 Difference]: With dead ends: 397725 [2018-12-09 12:54:05,749 INFO L226 Difference]: Without dead ends: 393715 [2018-12-09 12:54:05,750 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 12:54:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393715 states. [2018-12-09 12:54:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393715 to 326395. [2018-12-09 12:54:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326395 states. [2018-12-09 12:54:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326395 states to 326395 states and 1442053 transitions. [2018-12-09 12:54:13,272 INFO L78 Accepts]: Start accepts. Automaton has 326395 states and 1442053 transitions. Word has length 77 [2018-12-09 12:54:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:54:13,272 INFO L480 AbstractCegarLoop]: Abstraction has 326395 states and 1442053 transitions. [2018-12-09 12:54:13,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:54:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 326395 states and 1442053 transitions. [2018-12-09 12:54:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 12:54:13,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:54:13,553 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] [2018-12-09 12:54:13,553 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:54:13,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:54:13,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2115059952, now seen corresponding path program 1 times [2018-12-09 12:54:13,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:54:13,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:13,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:54:13,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:13,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:54:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:54:13,622 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 12:54:13,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:54:13,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:54:13,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:54:13,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:54:13,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:54:13,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:54:13,623 INFO L87 Difference]: Start difference. First operand 326395 states and 1442053 transitions. Second operand 7 states. [2018-12-09 12:54:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:54:19,439 INFO L93 Difference]: Finished difference Result 477435 states and 2056850 transitions. [2018-12-09 12:54:19,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:54:19,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-09 12:54:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:54:21,087 INFO L225 Difference]: With dead ends: 477435 [2018-12-09 12:54:21,087 INFO L226 Difference]: Without dead ends: 477435 [2018-12-09 12:54:21,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 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 12:54:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477435 states. [2018-12-09 12:54:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477435 to 435770. [2018-12-09 12:54:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435770 states. [2018-12-09 12:54:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435770 states to 435770 states and 1891113 transitions. [2018-12-09 12:54:30,379 INFO L78 Accepts]: Start accepts. Automaton has 435770 states and 1891113 transitions. Word has length 77 [2018-12-09 12:54:30,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:54:30,379 INFO L480 AbstractCegarLoop]: Abstraction has 435770 states and 1891113 transitions. [2018-12-09 12:54:30,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:54:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 435770 states and 1891113 transitions. [2018-12-09 12:54:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 12:54:30,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:54:30,797 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] [2018-12-09 12:54:30,797 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:54:30,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:54:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash -870295471, now seen corresponding path program 1 times [2018-12-09 12:54:30,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:54:30,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:30,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:54:30,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:30,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:54:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:54:30,828 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 12:54:30,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:54:30,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:54:30,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:54:30,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:54:30,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:54:30,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:54:30,830 INFO L87 Difference]: Start difference. First operand 435770 states and 1891113 transitions. Second operand 4 states. [2018-12-09 12:54:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:54:33,117 INFO L93 Difference]: Finished difference Result 376005 states and 1609116 transitions. [2018-12-09 12:54:33,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:54:33,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-09 12:54:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:54:34,611 INFO L225 Difference]: With dead ends: 376005 [2018-12-09 12:54:34,611 INFO L226 Difference]: Without dead ends: 373300 [2018-12-09 12:54:34,611 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 12:54:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373300 states. [2018-12-09 12:54:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373300 to 373300. [2018-12-09 12:54:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373300 states. [2018-12-09 12:54:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373300 states to 373300 states and 1600154 transitions. [2018-12-09 12:54:45,802 INFO L78 Accepts]: Start accepts. Automaton has 373300 states and 1600154 transitions. Word has length 77 [2018-12-09 12:54:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:54:45,802 INFO L480 AbstractCegarLoop]: Abstraction has 373300 states and 1600154 transitions. [2018-12-09 12:54:45,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:54:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 373300 states and 1600154 transitions. [2018-12-09 12:54:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:54:46,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:54:46,135 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] [2018-12-09 12:54:46,135 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:54:46,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:54:46,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1637958395, now seen corresponding path program 1 times [2018-12-09 12:54:46,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:54:46,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:46,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:54:46,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:46,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:54:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:54:46,650 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 12:54:46,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:54:46,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:54:46,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:54:46,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:54:46,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:54:46,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:54:46,651 INFO L87 Difference]: Start difference. First operand 373300 states and 1600154 transitions. Second operand 5 states. [2018-12-09 12:54:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:54:47,097 INFO L93 Difference]: Finished difference Result 104404 states and 415166 transitions. [2018-12-09 12:54:47,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:54:47,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-09 12:54:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:54:47,324 INFO L225 Difference]: With dead ends: 104404 [2018-12-09 12:54:47,325 INFO L226 Difference]: Without dead ends: 102012 [2018-12-09 12:54:47,325 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 12:54:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102012 states. [2018-12-09 12:54:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102012 to 101952. [2018-12-09 12:54:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101952 states. [2018-12-09 12:54:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101952 states to 101952 states and 406002 transitions. [2018-12-09 12:54:49,275 INFO L78 Accepts]: Start accepts. Automaton has 101952 states and 406002 transitions. Word has length 78 [2018-12-09 12:54:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:54:49,276 INFO L480 AbstractCegarLoop]: Abstraction has 101952 states and 406002 transitions. [2018-12-09 12:54:49,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:54:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 101952 states and 406002 transitions. [2018-12-09 12:54:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 12:54:49,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:54:49,367 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] [2018-12-09 12:54:49,367 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:54:49,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:54:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash 160574097, now seen corresponding path program 1 times [2018-12-09 12:54:49,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:54:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:49,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:54:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:49,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:54:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:54:49,413 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 12:54:49,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:54:49,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:54:49,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:54:49,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:54:49,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:54:49,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:54:49,414 INFO L87 Difference]: Start difference. First operand 101952 states and 406002 transitions. Second operand 4 states. [2018-12-09 12:54:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:54:50,025 INFO L93 Difference]: Finished difference Result 137720 states and 542591 transitions. [2018-12-09 12:54:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:54:50,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-09 12:54:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:54:50,325 INFO L225 Difference]: With dead ends: 137720 [2018-12-09 12:54:50,326 INFO L226 Difference]: Without dead ends: 137720 [2018-12-09 12:54:50,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 12:54:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137720 states. [2018-12-09 12:54:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137720 to 107480. [2018-12-09 12:54:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107480 states. [2018-12-09 12:54:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107480 states to 107480 states and 426735 transitions. [2018-12-09 12:54:52,319 INFO L78 Accepts]: Start accepts. Automaton has 107480 states and 426735 transitions. Word has length 88 [2018-12-09 12:54:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:54:52,319 INFO L480 AbstractCegarLoop]: Abstraction has 107480 states and 426735 transitions. [2018-12-09 12:54:52,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:54:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 107480 states and 426735 transitions. [2018-12-09 12:54:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 12:54:52,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:54:52,416 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] [2018-12-09 12:54:52,416 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:54:52,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:54:52,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1150602033, now seen corresponding path program 1 times [2018-12-09 12:54:52,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:54:52,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:52,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:54:52,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:52,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:54:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:54:52,450 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 12:54:52,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:54:52,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:54:52,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:54:52,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:54:52,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:54:52,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:54:52,450 INFO L87 Difference]: Start difference. First operand 107480 states and 426735 transitions. Second operand 4 states. [2018-12-09 12:54:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:54:53,529 INFO L93 Difference]: Finished difference Result 147543 states and 578741 transitions. [2018-12-09 12:54:53,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:54:53,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-09 12:54:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:54:53,849 INFO L225 Difference]: With dead ends: 147543 [2018-12-09 12:54:53,850 INFO L226 Difference]: Without dead ends: 147543 [2018-12-09 12:54:53,850 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 12:54:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147543 states. [2018-12-09 12:54:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147543 to 134136. [2018-12-09 12:54:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134136 states. [2018-12-09 12:54:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134136 states to 134136 states and 529007 transitions. [2018-12-09 12:54:56,073 INFO L78 Accepts]: Start accepts. Automaton has 134136 states and 529007 transitions. Word has length 88 [2018-12-09 12:54:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:54:56,073 INFO L480 AbstractCegarLoop]: Abstraction has 134136 states and 529007 transitions. [2018-12-09 12:54:56,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:54:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 134136 states and 529007 transitions. [2018-12-09 12:54:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 12:54:56,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:54:56,190 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] [2018-12-09 12:54:56,190 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:54:56,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:54:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1480367794, now seen corresponding path program 1 times [2018-12-09 12:54:56,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:54:56,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:56,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:54:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:54:56,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:54:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:54:56,268 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 12:54:56,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:54:56,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:54:56,269 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:54:56,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:54:56,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:54:56,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:54:56,269 INFO L87 Difference]: Start difference. First operand 134136 states and 529007 transitions. Second operand 8 states. [2018-12-09 12:54:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:54:58,058 INFO L93 Difference]: Finished difference Result 196170 states and 756695 transitions. [2018-12-09 12:54:58,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 12:54:58,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-12-09 12:54:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:54:58,456 INFO L225 Difference]: With dead ends: 196170 [2018-12-09 12:54:58,457 INFO L226 Difference]: Without dead ends: 194570 [2018-12-09 12:54:58,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:54:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194570 states. [2018-12-09 12:55:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194570 to 145961. [2018-12-09 12:55:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145961 states. [2018-12-09 12:55:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145961 states to 145961 states and 572957 transitions. [2018-12-09 12:55:01,101 INFO L78 Accepts]: Start accepts. Automaton has 145961 states and 572957 transitions. Word has length 88 [2018-12-09 12:55:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:01,102 INFO L480 AbstractCegarLoop]: Abstraction has 145961 states and 572957 transitions. [2018-12-09 12:55:01,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:55:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 145961 states and 572957 transitions. [2018-12-09 12:55:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 12:55:01,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:01,238 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] [2018-12-09 12:55:01,238 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:01,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:01,239 INFO L82 PathProgramCache]: Analyzing trace with hash 635895923, now seen corresponding path program 1 times [2018-12-09 12:55:01,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:01,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:01,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:01,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:01,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:01,289 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 12:55:01,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:01,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:55:01,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:01,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:55:01,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:55:01,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:55:01,290 INFO L87 Difference]: Start difference. First operand 145961 states and 572957 transitions. Second operand 6 states. [2018-12-09 12:55:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:01,378 INFO L93 Difference]: Finished difference Result 22153 states and 74477 transitions. [2018-12-09 12:55:01,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:55:01,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-12-09 12:55:01,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:01,402 INFO L225 Difference]: With dead ends: 22153 [2018-12-09 12:55:01,402 INFO L226 Difference]: Without dead ends: 19123 [2018-12-09 12:55:01,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:55:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19123 states. [2018-12-09 12:55:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19123 to 17883. [2018-12-09 12:55:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17883 states. [2018-12-09 12:55:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17883 states to 17883 states and 60376 transitions. [2018-12-09 12:55:01,597 INFO L78 Accepts]: Start accepts. Automaton has 17883 states and 60376 transitions. Word has length 88 [2018-12-09 12:55:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:01,597 INFO L480 AbstractCegarLoop]: Abstraction has 17883 states and 60376 transitions. [2018-12-09 12:55:01,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:55:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 17883 states and 60376 transitions. [2018-12-09 12:55:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 12:55:01,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:01,612 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, 1, 1, 1, 1, 1] [2018-12-09 12:55:01,612 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:01,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:01,612 INFO L82 PathProgramCache]: Analyzing trace with hash -323882767, now seen corresponding path program 1 times [2018-12-09 12:55:01,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:01,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:01,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:01,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:01,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:01,660 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 12:55:01,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:01,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:55:01,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:01,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:55:01,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:55:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:55:01,661 INFO L87 Difference]: Start difference. First operand 17883 states and 60376 transitions. Second operand 4 states. [2018-12-09 12:55:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:01,772 INFO L93 Difference]: Finished difference Result 20589 states and 68728 transitions. [2018-12-09 12:55:01,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:55:01,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-09 12:55:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:01,796 INFO L225 Difference]: With dead ends: 20589 [2018-12-09 12:55:01,796 INFO L226 Difference]: Without dead ends: 20449 [2018-12-09 12:55:01,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:55:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20449 states. [2018-12-09 12:55:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20449 to 20216. [2018-12-09 12:55:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20216 states. [2018-12-09 12:55:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20216 states to 20216 states and 67696 transitions. [2018-12-09 12:55:02,039 INFO L78 Accepts]: Start accepts. Automaton has 20216 states and 67696 transitions. Word has length 101 [2018-12-09 12:55:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:02,039 INFO L480 AbstractCegarLoop]: Abstraction has 20216 states and 67696 transitions. [2018-12-09 12:55:02,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:55:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 20216 states and 67696 transitions. [2018-12-09 12:55:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 12:55:02,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:02,054 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, 1, 1, 1, 1, 1] [2018-12-09 12:55:02,054 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:02,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:02,054 INFO L82 PathProgramCache]: Analyzing trace with hash 645698256, now seen corresponding path program 1 times [2018-12-09 12:55:02,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:02,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:02,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:02,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:02,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:02,083 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 12:55:02,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:02,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:55:02,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:02,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:55:02,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:55:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:55:02,083 INFO L87 Difference]: Start difference. First operand 20216 states and 67696 transitions. Second operand 4 states. [2018-12-09 12:55:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:02,257 INFO L93 Difference]: Finished difference Result 24660 states and 82838 transitions. [2018-12-09 12:55:02,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:55:02,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-09 12:55:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:02,289 INFO L225 Difference]: With dead ends: 24660 [2018-12-09 12:55:02,289 INFO L226 Difference]: Without dead ends: 24660 [2018-12-09 12:55:02,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:55:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24660 states. [2018-12-09 12:55:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24660 to 19541. [2018-12-09 12:55:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19541 states. [2018-12-09 12:55:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19541 states to 19541 states and 65261 transitions. [2018-12-09 12:55:02,522 INFO L78 Accepts]: Start accepts. Automaton has 19541 states and 65261 transitions. Word has length 101 [2018-12-09 12:55:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:02,522 INFO L480 AbstractCegarLoop]: Abstraction has 19541 states and 65261 transitions. [2018-12-09 12:55:02,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:55:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 19541 states and 65261 transitions. [2018-12-09 12:55:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 12:55:02,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:02,537 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, 1, 1, 1, 1, 1] [2018-12-09 12:55:02,537 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:02,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:02,538 INFO L82 PathProgramCache]: Analyzing trace with hash -90144670, now seen corresponding path program 2 times [2018-12-09 12:55:02,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:02,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:02,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:02,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:02,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:02,586 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 12:55:02,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:02,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:55:02,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:02,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:55:02,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:55:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:55:02,586 INFO L87 Difference]: Start difference. First operand 19541 states and 65261 transitions. Second operand 5 states. [2018-12-09 12:55:02,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:02,741 INFO L93 Difference]: Finished difference Result 21587 states and 71630 transitions. [2018-12-09 12:55:02,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:55:02,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-09 12:55:02,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:02,767 INFO L225 Difference]: With dead ends: 21587 [2018-12-09 12:55:02,767 INFO L226 Difference]: Without dead ends: 21447 [2018-12-09 12:55:02,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 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 12:55:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21447 states. [2018-12-09 12:55:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21447 to 19566. [2018-12-09 12:55:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19566 states. [2018-12-09 12:55:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19566 states to 19566 states and 65291 transitions. [2018-12-09 12:55:02,990 INFO L78 Accepts]: Start accepts. Automaton has 19566 states and 65291 transitions. Word has length 101 [2018-12-09 12:55:02,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:02,990 INFO L480 AbstractCegarLoop]: Abstraction has 19566 states and 65291 transitions. [2018-12-09 12:55:02,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:55:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 19566 states and 65291 transitions. [2018-12-09 12:55:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 12:55:03,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:03,005 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:55:03,006 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:03,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:03,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1457509930, now seen corresponding path program 1 times [2018-12-09 12:55:03,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:03,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:55:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:03,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:03,047 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 12:55:03,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:03,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:55:03,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:03,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:55:03,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:55:03,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:55:03,048 INFO L87 Difference]: Start difference. First operand 19566 states and 65291 transitions. Second operand 4 states. [2018-12-09 12:55:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:03,190 INFO L93 Difference]: Finished difference Result 34741 states and 116437 transitions. [2018-12-09 12:55:03,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:55:03,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-09 12:55:03,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:03,233 INFO L225 Difference]: With dead ends: 34741 [2018-12-09 12:55:03,233 INFO L226 Difference]: Without dead ends: 34601 [2018-12-09 12:55:03,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:55:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34601 states. [2018-12-09 12:55:03,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34601 to 19176. [2018-12-09 12:55:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19176 states. [2018-12-09 12:55:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19176 states to 19176 states and 63809 transitions. [2018-12-09 12:55:03,504 INFO L78 Accepts]: Start accepts. Automaton has 19176 states and 63809 transitions. Word has length 103 [2018-12-09 12:55:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:03,504 INFO L480 AbstractCegarLoop]: Abstraction has 19176 states and 63809 transitions. [2018-12-09 12:55:03,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:55:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 19176 states and 63809 transitions. [2018-12-09 12:55:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 12:55:03,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:03,518 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:55:03,519 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:03,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:03,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1127744169, now seen corresponding path program 1 times [2018-12-09 12:55:03,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:03,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:03,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:03,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:03,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:03,592 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 12:55:03,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:03,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:55:03,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:03,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:55:03,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:55:03,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:55:03,593 INFO L87 Difference]: Start difference. First operand 19176 states and 63809 transitions. Second operand 7 states. [2018-12-09 12:55:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:03,766 INFO L93 Difference]: Finished difference Result 21055 states and 69635 transitions. [2018-12-09 12:55:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:55:03,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-09 12:55:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:03,790 INFO L225 Difference]: With dead ends: 21055 [2018-12-09 12:55:03,790 INFO L226 Difference]: Without dead ends: 21055 [2018-12-09 12:55:03,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:55:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21055 states. [2018-12-09 12:55:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21055 to 19631. [2018-12-09 12:55:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19631 states. [2018-12-09 12:55:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19631 states to 19631 states and 65043 transitions. [2018-12-09 12:55:04,043 INFO L78 Accepts]: Start accepts. Automaton has 19631 states and 65043 transitions. Word has length 103 [2018-12-09 12:55:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:04,043 INFO L480 AbstractCegarLoop]: Abstraction has 19631 states and 65043 transitions. [2018-12-09 12:55:04,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:55:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 19631 states and 65043 transitions. [2018-12-09 12:55:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 12:55:04,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:04,059 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:55:04,059 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:04,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1983875830, now seen corresponding path program 1 times [2018-12-09 12:55:04,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:04,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:04,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:04,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:04,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:04,095 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 12:55:04,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:04,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:55:04,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:04,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:55:04,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:55:04,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:55:04,095 INFO L87 Difference]: Start difference. First operand 19631 states and 65043 transitions. Second operand 5 states. [2018-12-09 12:55:04,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:04,196 INFO L93 Difference]: Finished difference Result 17370 states and 57797 transitions. [2018-12-09 12:55:04,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:55:04,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-12-09 12:55:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:04,219 INFO L225 Difference]: With dead ends: 17370 [2018-12-09 12:55:04,219 INFO L226 Difference]: Without dead ends: 17370 [2018-12-09 12:55:04,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:55:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17370 states. [2018-12-09 12:55:04,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17370 to 16910. [2018-12-09 12:55:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16910 states. [2018-12-09 12:55:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16910 states to 16910 states and 56484 transitions. [2018-12-09 12:55:04,400 INFO L78 Accepts]: Start accepts. Automaton has 16910 states and 56484 transitions. Word has length 103 [2018-12-09 12:55:04,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:04,401 INFO L480 AbstractCegarLoop]: Abstraction has 16910 states and 56484 transitions. [2018-12-09 12:55:04,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:55:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 16910 states and 56484 transitions. [2018-12-09 12:55:04,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 12:55:04,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:04,415 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:55:04,415 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:04,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:04,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1061192247, now seen corresponding path program 1 times [2018-12-09 12:55:04,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:04,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:04,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:04,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:04,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:04,499 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 12:55:04,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:04,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:55:04,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:04,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:55:04,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:55:04,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:55:04,500 INFO L87 Difference]: Start difference. First operand 16910 states and 56484 transitions. Second operand 6 states. [2018-12-09 12:55:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:04,624 INFO L93 Difference]: Finished difference Result 13838 states and 45284 transitions. [2018-12-09 12:55:04,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:55:04,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-12-09 12:55:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:04,640 INFO L225 Difference]: With dead ends: 13838 [2018-12-09 12:55:04,640 INFO L226 Difference]: Without dead ends: 13838 [2018-12-09 12:55:04,640 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 12:55:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13838 states. [2018-12-09 12:55:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13838 to 12349. [2018-12-09 12:55:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12349 states. [2018-12-09 12:55:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12349 states to 12349 states and 40670 transitions. [2018-12-09 12:55:04,773 INFO L78 Accepts]: Start accepts. Automaton has 12349 states and 40670 transitions. Word has length 103 [2018-12-09 12:55:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:04,773 INFO L480 AbstractCegarLoop]: Abstraction has 12349 states and 40670 transitions. [2018-12-09 12:55:04,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:55:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 12349 states and 40670 transitions. [2018-12-09 12:55:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 12:55:04,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:04,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:55:04,783 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:04,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:04,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1159044518, now seen corresponding path program 1 times [2018-12-09 12:55:04,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:04,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:04,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:04,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:04,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:04,845 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 12:55:04,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:04,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:55:04,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:04,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:55:04,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:55:04,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:55:04,845 INFO L87 Difference]: Start difference. First operand 12349 states and 40670 transitions. Second operand 6 states. [2018-12-09 12:55:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:04,925 INFO L93 Difference]: Finished difference Result 13074 states and 42480 transitions. [2018-12-09 12:55:04,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:55:04,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-09 12:55:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:04,941 INFO L225 Difference]: With dead ends: 13074 [2018-12-09 12:55:04,941 INFO L226 Difference]: Without dead ends: 12849 [2018-12-09 12:55:04,942 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 12:55:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12849 states. [2018-12-09 12:55:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12849 to 12214. [2018-12-09 12:55:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2018-12-09 12:55:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 40137 transitions. [2018-12-09 12:55:05,068 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 40137 transitions. Word has length 105 [2018-12-09 12:55:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:05,068 INFO L480 AbstractCegarLoop]: Abstraction has 12214 states and 40137 transitions. [2018-12-09 12:55:05,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:55:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 40137 transitions. [2018-12-09 12:55:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 12:55:05,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:05,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:55:05,077 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:05,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:05,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1200262491, now seen corresponding path program 1 times [2018-12-09 12:55:05,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:05,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:05,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:05,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:05,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:05,126 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 12:55:05,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:05,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:55:05,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:05,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:55:05,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:55:05,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:55:05,127 INFO L87 Difference]: Start difference. First operand 12214 states and 40137 transitions. Second operand 5 states. [2018-12-09 12:55:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:05,250 INFO L93 Difference]: Finished difference Result 14006 states and 45897 transitions. [2018-12-09 12:55:05,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:55:05,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-09 12:55:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:05,265 INFO L225 Difference]: With dead ends: 14006 [2018-12-09 12:55:05,266 INFO L226 Difference]: Without dead ends: 13878 [2018-12-09 12:55:05,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 12:55:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13878 states. [2018-12-09 12:55:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13878 to 11363. [2018-12-09 12:55:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11363 states. [2018-12-09 12:55:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 37397 transitions. [2018-12-09 12:55:05,393 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 37397 transitions. Word has length 105 [2018-12-09 12:55:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:05,393 INFO L480 AbstractCegarLoop]: Abstraction has 11363 states and 37397 transitions. [2018-12-09 12:55:05,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:55:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 37397 transitions. [2018-12-09 12:55:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 12:55:05,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:05,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:55:05,403 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:05,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1849940324, now seen corresponding path program 1 times [2018-12-09 12:55:05,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:05,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:05,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:05,451 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 12:55:05,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:05,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:55:05,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:05,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:55:05,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:55:05,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:55:05,452 INFO L87 Difference]: Start difference. First operand 11363 states and 37397 transitions. Second operand 5 states. [2018-12-09 12:55:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:05,506 INFO L93 Difference]: Finished difference Result 18171 states and 60562 transitions. [2018-12-09 12:55:05,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:55:05,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-09 12:55:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:05,528 INFO L225 Difference]: With dead ends: 18171 [2018-12-09 12:55:05,528 INFO L226 Difference]: Without dead ends: 18171 [2018-12-09 12:55:05,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 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 12:55:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18171 states. [2018-12-09 12:55:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18171 to 11243. [2018-12-09 12:55:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11243 states. [2018-12-09 12:55:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11243 states to 11243 states and 36776 transitions. [2018-12-09 12:55:05,673 INFO L78 Accepts]: Start accepts. Automaton has 11243 states and 36776 transitions. Word has length 105 [2018-12-09 12:55:05,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:05,673 INFO L480 AbstractCegarLoop]: Abstraction has 11243 states and 36776 transitions. [2018-12-09 12:55:05,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:55:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 11243 states and 36776 transitions. [2018-12-09 12:55:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 12:55:05,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:05,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:55:05,682 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:05,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:05,682 INFO L82 PathProgramCache]: Analyzing trace with hash -880359301, now seen corresponding path program 1 times [2018-12-09 12:55:05,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:05,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:05,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:05,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:05,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:05,772 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 12:55:05,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:05,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 12:55:05,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:05,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 12:55:05,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 12:55:05,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:55:05,772 INFO L87 Difference]: Start difference. First operand 11243 states and 36776 transitions. Second operand 10 states. [2018-12-09 12:55:06,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:06,002 INFO L93 Difference]: Finished difference Result 21431 states and 70777 transitions. [2018-12-09 12:55:06,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 12:55:06,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2018-12-09 12:55:06,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:06,013 INFO L225 Difference]: With dead ends: 21431 [2018-12-09 12:55:06,014 INFO L226 Difference]: Without dead ends: 10583 [2018-12-09 12:55:06,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-12-09 12:55:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10583 states. [2018-12-09 12:55:06,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10583 to 10583. [2018-12-09 12:55:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10583 states. [2018-12-09 12:55:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 34856 transitions. [2018-12-09 12:55:06,117 INFO L78 Accepts]: Start accepts. Automaton has 10583 states and 34856 transitions. Word has length 105 [2018-12-09 12:55:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:06,117 INFO L480 AbstractCegarLoop]: Abstraction has 10583 states and 34856 transitions. [2018-12-09 12:55:06,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 12:55:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 10583 states and 34856 transitions. [2018-12-09 12:55:06,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 12:55:06,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:06,126 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:06,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:06,126 INFO L82 PathProgramCache]: Analyzing trace with hash -287902169, now seen corresponding path program 2 times [2018-12-09 12:55:06,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:06,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:06,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:55:06,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:06,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:06,189 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 12:55:06,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:06,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 12:55:06,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:06,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 12:55:06,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 12:55:06,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:55:06,190 INFO L87 Difference]: Start difference. First operand 10583 states and 34856 transitions. Second operand 9 states. [2018-12-09 12:55:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:06,321 INFO L93 Difference]: Finished difference Result 17971 states and 59941 transitions. [2018-12-09 12:55:06,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:55:06,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-09 12:55:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:06,331 INFO L225 Difference]: With dead ends: 17971 [2018-12-09 12:55:06,331 INFO L226 Difference]: Without dead ends: 7632 [2018-12-09 12:55:06,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-09 12:55:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7632 states. [2018-12-09 12:55:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7632 to 7632. [2018-12-09 12:55:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7632 states. [2018-12-09 12:55:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7632 states to 7632 states and 25729 transitions. [2018-12-09 12:55:06,404 INFO L78 Accepts]: Start accepts. Automaton has 7632 states and 25729 transitions. Word has length 105 [2018-12-09 12:55:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:06,405 INFO L480 AbstractCegarLoop]: Abstraction has 7632 states and 25729 transitions. [2018-12-09 12:55:06,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 12:55:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7632 states and 25729 transitions. [2018-12-09 12:55:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 12:55:06,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:06,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:55:06,411 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:06,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:06,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1777138289, now seen corresponding path program 3 times [2018-12-09 12:55:06,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:06,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:06,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:55:06,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:06,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:06,494 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 12:55:06,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:55:06,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 12:55:06,494 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:55:06,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 12:55:06,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 12:55:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:55:06,495 INFO L87 Difference]: Start difference. First operand 7632 states and 25729 transitions. Second operand 12 states. [2018-12-09 12:55:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:55:06,821 INFO L93 Difference]: Finished difference Result 14700 states and 49790 transitions. [2018-12-09 12:55:06,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 12:55:06,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-12-09 12:55:06,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:55:06,832 INFO L225 Difference]: With dead ends: 14700 [2018-12-09 12:55:06,832 INFO L226 Difference]: Without dead ends: 10156 [2018-12-09 12:55:06,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 12:55:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2018-12-09 12:55:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 9548. [2018-12-09 12:55:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9548 states. [2018-12-09 12:55:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9548 states to 9548 states and 31622 transitions. [2018-12-09 12:55:06,927 INFO L78 Accepts]: Start accepts. Automaton has 9548 states and 31622 transitions. Word has length 105 [2018-12-09 12:55:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:55:06,927 INFO L480 AbstractCegarLoop]: Abstraction has 9548 states and 31622 transitions. [2018-12-09 12:55:06,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 12:55:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9548 states and 31622 transitions. [2018-12-09 12:55:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 12:55:06,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:55:06,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:55:06,935 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:55:06,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:55:06,935 INFO L82 PathProgramCache]: Analyzing trace with hash 653369973, now seen corresponding path program 4 times [2018-12-09 12:55:06,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:55:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:06,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:55:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:55:06,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:55:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:55:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:55:06,984 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:55:07,077 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 12:55:07,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:55:07 BasicIcfg [2018-12-09 12:55:07,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:55:07,079 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:55:07,079 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:55:07,079 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:55:07,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:51:55" (3/4) ... [2018-12-09 12:55:07,082 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:55:07,156 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1befb778-87ee-47ee-8886-3cb1c1ebb086/bin-2019/utaipan/witness.graphml [2018-12-09 12:55:07,157 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:55:07,157 INFO L168 Benchmark]: Toolchain (without parser) took 192128.10 ms. Allocated memory was 1.0 GB in the beginning and 10.1 GB in the end (delta: 9.1 GB). Free memory was 947.0 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 5.8 GB. Max. memory is 11.5 GB. [2018-12-09 12:55:07,158 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:55:07,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-09 12:55:07,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.54 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:55:07,158 INFO L168 Benchmark]: Boogie Preprocessor took 19.89 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 12:55:07,158 INFO L168 Benchmark]: RCFGBuilder took 354.99 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: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:55:07,159 INFO L168 Benchmark]: TraceAbstraction took 191285.08 ms. Allocated memory was 1.1 GB in the beginning and 10.1 GB in the end (delta: 9.0 GB). Free memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 5.7 GB. Max. memory is 11.5 GB. [2018-12-09 12:55:07,159 INFO L168 Benchmark]: Witness Printer took 77.77 ms. Allocated memory is still 10.1 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-12-09 12:55:07,160 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.54 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.89 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 354.99 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: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 191285.08 ms. Allocated memory was 1.1 GB in the beginning and 10.1 GB in the end (delta: 9.0 GB). Free memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 5.7 GB. Max. memory is 11.5 GB. * Witness Printer took 77.77 ms. Allocated memory is still 10.1 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1128; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1128, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1129; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1129, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t1130; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t1130, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 y$w_buff1 = y$w_buff0 [L746] 0 y$w_buff0 = 2 [L747] 0 y$w_buff1_used = y$w_buff0_used [L748] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L751] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L752] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L753] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L754] 0 y$r_buff0_thd3 = (_Bool)1 [L757] 0 z = 1 [L760] 0 __unbuffered_p2_EAX = z [L763] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 __unbuffered_p0_EAX = x [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 1 [L728] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 2 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L731] EXPR 2 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L731] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 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=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, 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, z=1] [L733] 2 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 [L734] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 2 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=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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, z=1] [L735] 2 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 [L738] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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) [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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 [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -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 [L806] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L807] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L808] -1 y$flush_delayed = weak$$choice2 [L809] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y = y$flush_delayed ? y$mem_tmp : y [L819] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 201 locations, 3 error locations. UNSAFE Result, 191.2s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 62.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9014 SDtfs, 10534 SDslu, 21469 SDs, 0 SdLazy, 7726 SolverSat, 516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 91 SyntacticMatches, 20 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=435770occurred in iteration=13, 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: 110.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 1350623 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2801 NumberOfCodeBlocks, 2801 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2664 ConstructedInterpolants, 0 QuantifiedInterpolants, 547883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...