./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/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 bedc30426f84517809c1aba2f717b94ba4147624 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 17:02:24,562 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:02:24,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:02:24,569 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:02:24,569 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:02:24,570 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:02:24,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:02:24,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:02:24,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:02:24,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:02:24,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:02:24,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:02:24,574 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:02:24,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:02:24,575 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:02:24,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:02:24,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:02:24,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:02:24,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:02:24,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:02:24,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:02:24,579 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:02:24,581 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:02:24,581 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:02:24,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:02:24,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:02:24,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:02:24,582 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:02:24,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:02:24,583 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:02:24,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:02:24,584 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:02:24,584 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:02:24,584 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:02:24,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:02:24,585 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:02:24,585 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 17:02:24,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:02:24,593 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:02:24,594 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:02:24,594 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:02:24,594 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:02:24,594 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:02:24,594 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:02:24,594 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 17:02:24,594 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:02:24,595 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:02:24,595 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 17:02:24,595 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 17:02:24,595 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:02:24,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:02:24,595 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:02:24,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:02:24,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:02:24,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:02:24,596 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:02:24,596 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:02:24,596 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:02:24,596 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:02:24,596 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:02:24,596 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:02:24,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:02:24,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:02:24,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:02:24,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:02:24,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:02:24,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:02:24,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:02:24,597 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:02:24,597 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 17:02:24,597 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:02:24,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:02:24,597 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 17:02:24,597 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_6b31c62c-9026-45f7-97f8-60d16287e981/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 -> bedc30426f84517809c1aba2f717b94ba4147624 [2018-12-08 17:02:24,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:02:24,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:02:24,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:02:24,628 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:02:24,628 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:02:24,629 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i [2018-12-08 17:02:24,669 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/bin-2019/utaipan/data/5d079e901/6caf975c0bc3403095f6fcca7134b7f5/FLAGa88ac0b26 [2018-12-08 17:02:25,147 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:02:25,147 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/sv-benchmarks/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i [2018-12-08 17:02:25,154 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/bin-2019/utaipan/data/5d079e901/6caf975c0bc3403095f6fcca7134b7f5/FLAGa88ac0b26 [2018-12-08 17:02:25,650 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/bin-2019/utaipan/data/5d079e901/6caf975c0bc3403095f6fcca7134b7f5 [2018-12-08 17:02:25,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:02:25,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:02:25,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:02:25,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:02:25,657 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:02:25,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:02:25" (1/1) ... [2018-12-08 17:02:25,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7014c445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:25, skipping insertion in model container [2018-12-08 17:02:25,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:02:25" (1/1) ... [2018-12-08 17:02:25,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:02:25,691 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:02:25,910 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:02:25,919 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:02:26,009 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:02:26,038 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:02:26,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26 WrapperNode [2018-12-08 17:02:26,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:02:26,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:02:26,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:02:26,039 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:02:26,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26" (1/1) ... [2018-12-08 17:02:26,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26" (1/1) ... [2018-12-08 17:02:26,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:02:26,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:02:26,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:02:26,069 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:02:26,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26" (1/1) ... [2018-12-08 17:02:26,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26" (1/1) ... [2018-12-08 17:02:26,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26" (1/1) ... [2018-12-08 17:02:26,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26" (1/1) ... [2018-12-08 17:02:26,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26" (1/1) ... [2018-12-08 17:02:26,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26" (1/1) ... [2018-12-08 17:02:26,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26" (1/1) ... [2018-12-08 17:02:26,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:02:26,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:02:26,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:02:26,088 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:02:26,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/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-08 17:02:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:02:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:02:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 17:02:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:02:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 17:02:26,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 17:02:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 17:02:26,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 17:02:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 17:02:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:02:26,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:02:26,120 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 17:02:26,409 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:02:26,409 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 17:02:26,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:02:26 BoogieIcfgContainer [2018-12-08 17:02:26,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:02:26,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:02:26,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:02:26,412 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:02:26,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:02:25" (1/3) ... [2018-12-08 17:02:26,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768b131a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:02:26, skipping insertion in model container [2018-12-08 17:02:26,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:02:26" (2/3) ... [2018-12-08 17:02:26,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768b131a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:02:26, skipping insertion in model container [2018-12-08 17:02:26,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:02:26" (3/3) ... [2018-12-08 17:02:26,413 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc_false-unreach-call.i [2018-12-08 17:02:26,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,437 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,437 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,437 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,437 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,437 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,441 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,442 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:02:26,456 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 17:02:26,456 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:02:26,462 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 17:02:26,471 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 17:02:26,486 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:02:26,486 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:02:26,487 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:02:26,487 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:02:26,487 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:02:26,487 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:02:26,487 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:02:26,487 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:02:26,494 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 184 transitions [2018-12-08 17:02:28,001 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34810 states. [2018-12-08 17:02:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 34810 states. [2018-12-08 17:02:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:02:28,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:28,007 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] [2018-12-08 17:02:28,009 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:28,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:28,012 INFO L82 PathProgramCache]: Analyzing trace with hash 148401709, now seen corresponding path program 1 times [2018-12-08 17:02:28,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:28,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:28,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:28,157 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-08 17:02:28,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:28,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:02:28,159 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:28,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:02:28,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:02:28,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:02:28,171 INFO L87 Difference]: Start difference. First operand 34810 states. Second operand 4 states. [2018-12-08 17:02:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:28,721 INFO L93 Difference]: Finished difference Result 60794 states and 234497 transitions. [2018-12-08 17:02:28,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:02:28,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-08 17:02:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:28,876 INFO L225 Difference]: With dead ends: 60794 [2018-12-08 17:02:28,877 INFO L226 Difference]: Without dead ends: 44274 [2018-12-08 17:02:28,878 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-08 17:02:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44274 states. [2018-12-08 17:02:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44274 to 27342. [2018-12-08 17:02:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27342 states. [2018-12-08 17:02:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 105503 transitions. [2018-12-08 17:02:29,661 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 105503 transitions. Word has length 37 [2018-12-08 17:02:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:29,662 INFO L480 AbstractCegarLoop]: Abstraction has 27342 states and 105503 transitions. [2018-12-08 17:02:29,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:02:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 105503 transitions. [2018-12-08 17:02:29,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 17:02:29,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:29,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:02:29,666 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:29,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:29,667 INFO L82 PathProgramCache]: Analyzing trace with hash -54930118, now seen corresponding path program 1 times [2018-12-08 17:02:29,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:29,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:29,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:29,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:29,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:29,715 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-08 17:02:29,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:29,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:02:29,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:29,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:02:29,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:02:29,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:02:29,717 INFO L87 Difference]: Start difference. First operand 27342 states and 105503 transitions. Second operand 4 states. [2018-12-08 17:02:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:29,794 INFO L93 Difference]: Finished difference Result 8532 states and 28348 transitions. [2018-12-08 17:02:29,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:02:29,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-08 17:02:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:29,814 INFO L225 Difference]: With dead ends: 8532 [2018-12-08 17:02:29,814 INFO L226 Difference]: Without dead ends: 7470 [2018-12-08 17:02:29,815 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-08 17:02:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-08 17:02:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 7470. [2018-12-08 17:02:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7470 states. [2018-12-08 17:02:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 24640 transitions. [2018-12-08 17:02:29,904 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 24640 transitions. Word has length 49 [2018-12-08 17:02:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:29,904 INFO L480 AbstractCegarLoop]: Abstraction has 7470 states and 24640 transitions. [2018-12-08 17:02:29,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:02:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 24640 transitions. [2018-12-08 17:02:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 17:02:29,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:29,905 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] [2018-12-08 17:02:29,906 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:29,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:29,906 INFO L82 PathProgramCache]: Analyzing trace with hash -790300171, now seen corresponding path program 1 times [2018-12-08 17:02:29,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:29,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:29,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:29,952 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-08 17:02:29,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:29,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:02:29,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:29,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:02:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:02:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:29,953 INFO L87 Difference]: Start difference. First operand 7470 states and 24640 transitions. Second operand 5 states. [2018-12-08 17:02:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:30,154 INFO L93 Difference]: Finished difference Result 14002 states and 45809 transitions. [2018-12-08 17:02:30,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:02:30,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-08 17:02:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:30,172 INFO L225 Difference]: With dead ends: 14002 [2018-12-08 17:02:30,172 INFO L226 Difference]: Without dead ends: 13934 [2018-12-08 17:02:30,173 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-08 17:02:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13934 states. [2018-12-08 17:02:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13934 to 9445. [2018-12-08 17:02:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2018-12-08 17:02:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 30546 transitions. [2018-12-08 17:02:30,293 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 30546 transitions. Word has length 50 [2018-12-08 17:02:30,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:30,294 INFO L480 AbstractCegarLoop]: Abstraction has 9445 states and 30546 transitions. [2018-12-08 17:02:30,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:02:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 30546 transitions. [2018-12-08 17:02:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 17:02:30,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:30,295 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] [2018-12-08 17:02:30,295 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:30,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:30,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1702931131, now seen corresponding path program 1 times [2018-12-08 17:02:30,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:30,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:30,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:30,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:30,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:30,327 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-08 17:02:30,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:30,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:02:30,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:30,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:02:30,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:02:30,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:02:30,328 INFO L87 Difference]: Start difference. First operand 9445 states and 30546 transitions. Second operand 3 states. [2018-12-08 17:02:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:30,381 INFO L93 Difference]: Finished difference Result 13283 states and 42645 transitions. [2018-12-08 17:02:30,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:02:30,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-08 17:02:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:30,397 INFO L225 Difference]: With dead ends: 13283 [2018-12-08 17:02:30,397 INFO L226 Difference]: Without dead ends: 13283 [2018-12-08 17:02:30,397 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-08 17:02:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13283 states. [2018-12-08 17:02:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13283 to 9849. [2018-12-08 17:02:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2018-12-08 17:02:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 31512 transitions. [2018-12-08 17:02:30,574 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 31512 transitions. Word has length 52 [2018-12-08 17:02:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:30,574 INFO L480 AbstractCegarLoop]: Abstraction has 9849 states and 31512 transitions. [2018-12-08 17:02:30,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:02:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 31512 transitions. [2018-12-08 17:02:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:02:30,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:30,575 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] [2018-12-08 17:02:30,576 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:30,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:30,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1252831162, now seen corresponding path program 1 times [2018-12-08 17:02:30,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:30,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:30,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:30,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:30,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:30,633 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-08 17:02:30,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:30,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:02:30,634 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:30,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:02:30,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:02:30,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:02:30,634 INFO L87 Difference]: Start difference. First operand 9849 states and 31512 transitions. Second operand 6 states. [2018-12-08 17:02:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:30,897 INFO L93 Difference]: Finished difference Result 14207 states and 45068 transitions. [2018-12-08 17:02:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:02:30,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-08 17:02:30,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:30,913 INFO L225 Difference]: With dead ends: 14207 [2018-12-08 17:02:30,914 INFO L226 Difference]: Without dead ends: 14135 [2018-12-08 17:02:30,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:02:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14135 states. [2018-12-08 17:02:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14135 to 10853. [2018-12-08 17:02:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10853 states. [2018-12-08 17:02:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10853 states to 10853 states and 34567 transitions. [2018-12-08 17:02:31,039 INFO L78 Accepts]: Start accepts. Automaton has 10853 states and 34567 transitions. Word has length 56 [2018-12-08 17:02:31,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:31,039 INFO L480 AbstractCegarLoop]: Abstraction has 10853 states and 34567 transitions. [2018-12-08 17:02:31,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:02:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 10853 states and 34567 transitions. [2018-12-08 17:02:31,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 17:02:31,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:31,043 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] [2018-12-08 17:02:31,043 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:31,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash -575191646, now seen corresponding path program 1 times [2018-12-08 17:02:31,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:31,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:31,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:31,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:31,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:31,104 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-08 17:02:31,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:31,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:02:31,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:31,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:02:31,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:02:31,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:02:31,105 INFO L87 Difference]: Start difference. First operand 10853 states and 34567 transitions. Second operand 4 states. [2018-12-08 17:02:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:31,174 INFO L93 Difference]: Finished difference Result 12400 states and 39576 transitions. [2018-12-08 17:02:31,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:02:31,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 17:02:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:31,188 INFO L225 Difference]: With dead ends: 12400 [2018-12-08 17:02:31,188 INFO L226 Difference]: Without dead ends: 12400 [2018-12-08 17:02:31,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2018-12-08 17:02:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 11373. [2018-12-08 17:02:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11373 states. [2018-12-08 17:02:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11373 states to 11373 states and 36240 transitions. [2018-12-08 17:02:31,308 INFO L78 Accepts]: Start accepts. Automaton has 11373 states and 36240 transitions. Word has length 64 [2018-12-08 17:02:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:31,309 INFO L480 AbstractCegarLoop]: Abstraction has 11373 states and 36240 transitions. [2018-12-08 17:02:31,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:02:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 11373 states and 36240 transitions. [2018-12-08 17:02:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 17:02:31,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:31,312 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] [2018-12-08 17:02:31,312 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:31,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:31,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1167618689, now seen corresponding path program 1 times [2018-12-08 17:02:31,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:31,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:31,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:31,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:31,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:31,372 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-08 17:02:31,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:31,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:02:31,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:31,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:02:31,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:02:31,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:02:31,373 INFO L87 Difference]: Start difference. First operand 11373 states and 36240 transitions. Second operand 6 states. [2018-12-08 17:02:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:31,666 INFO L93 Difference]: Finished difference Result 20973 states and 66490 transitions. [2018-12-08 17:02:31,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:02:31,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-08 17:02:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:31,693 INFO L225 Difference]: With dead ends: 20973 [2018-12-08 17:02:31,693 INFO L226 Difference]: Without dead ends: 20902 [2018-12-08 17:02:31,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:02:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20902 states. [2018-12-08 17:02:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20902 to 13759. [2018-12-08 17:02:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13759 states. [2018-12-08 17:02:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13759 states to 13759 states and 43284 transitions. [2018-12-08 17:02:31,923 INFO L78 Accepts]: Start accepts. Automaton has 13759 states and 43284 transitions. Word has length 64 [2018-12-08 17:02:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:31,923 INFO L480 AbstractCegarLoop]: Abstraction has 13759 states and 43284 transitions. [2018-12-08 17:02:31,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:02:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 13759 states and 43284 transitions. [2018-12-08 17:02:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 17:02:31,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:31,928 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-08 17:02:31,929 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:31,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1129581006, now seen corresponding path program 1 times [2018-12-08 17:02:31,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:31,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:31,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:31,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:31,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:32,034 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-08 17:02:32,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:32,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:02:32,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:32,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:02:32,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:02:32,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:02:32,035 INFO L87 Difference]: Start difference. First operand 13759 states and 43284 transitions. Second operand 4 states. [2018-12-08 17:02:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:32,223 INFO L93 Difference]: Finished difference Result 17639 states and 54589 transitions. [2018-12-08 17:02:32,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:02:32,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-08 17:02:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:32,243 INFO L225 Difference]: With dead ends: 17639 [2018-12-08 17:02:32,243 INFO L226 Difference]: Without dead ends: 17639 [2018-12-08 17:02:32,244 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-08 17:02:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17639 states. [2018-12-08 17:02:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17639 to 15797. [2018-12-08 17:02:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15797 states. [2018-12-08 17:02:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15797 states to 15797 states and 49135 transitions. [2018-12-08 17:02:32,423 INFO L78 Accepts]: Start accepts. Automaton has 15797 states and 49135 transitions. Word has length 68 [2018-12-08 17:02:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:32,423 INFO L480 AbstractCegarLoop]: Abstraction has 15797 states and 49135 transitions. [2018-12-08 17:02:32,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:02:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 15797 states and 49135 transitions. [2018-12-08 17:02:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 17:02:32,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:32,428 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-08 17:02:32,428 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:32,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:32,428 INFO L82 PathProgramCache]: Analyzing trace with hash -947628337, now seen corresponding path program 1 times [2018-12-08 17:02:32,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:32,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:32,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:32,460 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-08 17:02:32,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:32,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:02:32,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:32,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:02:32,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:02:32,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:02:32,461 INFO L87 Difference]: Start difference. First operand 15797 states and 49135 transitions. Second operand 3 states. [2018-12-08 17:02:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:32,596 INFO L93 Difference]: Finished difference Result 16389 states and 50742 transitions. [2018-12-08 17:02:32,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:02:32,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-08 17:02:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:32,615 INFO L225 Difference]: With dead ends: 16389 [2018-12-08 17:02:32,615 INFO L226 Difference]: Without dead ends: 16389 [2018-12-08 17:02:32,616 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-08 17:02:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16389 states. [2018-12-08 17:02:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16389 to 16113. [2018-12-08 17:02:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16113 states. [2018-12-08 17:02:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16113 states to 16113 states and 49985 transitions. [2018-12-08 17:02:32,784 INFO L78 Accepts]: Start accepts. Automaton has 16113 states and 49985 transitions. Word has length 68 [2018-12-08 17:02:32,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:32,784 INFO L480 AbstractCegarLoop]: Abstraction has 16113 states and 49985 transitions. [2018-12-08 17:02:32,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:02:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 16113 states and 49985 transitions. [2018-12-08 17:02:32,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 17:02:32,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:32,790 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-08 17:02:32,791 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:32,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:32,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1412859306, now seen corresponding path program 1 times [2018-12-08 17:02:32,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:32,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:32,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:32,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:32,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:02:32,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:32,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:02:32,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:32,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:02:32,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:02:32,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:02:32,866 INFO L87 Difference]: Start difference. First operand 16113 states and 49985 transitions. Second operand 6 states. [2018-12-08 17:02:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:33,605 INFO L93 Difference]: Finished difference Result 19825 states and 60441 transitions. [2018-12-08 17:02:33,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:02:33,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-08 17:02:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:33,626 INFO L225 Difference]: With dead ends: 19825 [2018-12-08 17:02:33,626 INFO L226 Difference]: Without dead ends: 19825 [2018-12-08 17:02:33,626 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-08 17:02:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19825 states. [2018-12-08 17:02:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19825 to 18621. [2018-12-08 17:02:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18621 states. [2018-12-08 17:02:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18621 states to 18621 states and 57221 transitions. [2018-12-08 17:02:33,871 INFO L78 Accepts]: Start accepts. Automaton has 18621 states and 57221 transitions. Word has length 70 [2018-12-08 17:02:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:33,871 INFO L480 AbstractCegarLoop]: Abstraction has 18621 states and 57221 transitions. [2018-12-08 17:02:33,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:02:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 18621 states and 57221 transitions. [2018-12-08 17:02:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 17:02:33,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:33,878 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-08 17:02:33,878 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:33,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:33,879 INFO L82 PathProgramCache]: Analyzing trace with hash 804898647, now seen corresponding path program 1 times [2018-12-08 17:02:33,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:33,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:33,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:33,937 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-08 17:02:33,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:33,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:02:33,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:33,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:02:33,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:02:33,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:33,938 INFO L87 Difference]: Start difference. First operand 18621 states and 57221 transitions. Second operand 5 states. [2018-12-08 17:02:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:34,188 INFO L93 Difference]: Finished difference Result 24184 states and 73726 transitions. [2018-12-08 17:02:34,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:02:34,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-08 17:02:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:34,220 INFO L225 Difference]: With dead ends: 24184 [2018-12-08 17:02:34,220 INFO L226 Difference]: Without dead ends: 24184 [2018-12-08 17:02:34,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:02:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24184 states. [2018-12-08 17:02:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24184 to 22021. [2018-12-08 17:02:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22021 states. [2018-12-08 17:02:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 67146 transitions. [2018-12-08 17:02:34,463 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 67146 transitions. Word has length 70 [2018-12-08 17:02:34,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:34,463 INFO L480 AbstractCegarLoop]: Abstraction has 22021 states and 67146 transitions. [2018-12-08 17:02:34,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:02:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 67146 transitions. [2018-12-08 17:02:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 17:02:34,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:34,471 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-08 17:02:34,471 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:34,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash 294364470, now seen corresponding path program 1 times [2018-12-08 17:02:34,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:34,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:34,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:34,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:34,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:34,512 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-08 17:02:34,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:34,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:02:34,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:34,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:02:34,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:02:34,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:34,513 INFO L87 Difference]: Start difference. First operand 22021 states and 67146 transitions. Second operand 5 states. [2018-12-08 17:02:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:34,822 INFO L93 Difference]: Finished difference Result 30767 states and 92772 transitions. [2018-12-08 17:02:34,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:02:34,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-08 17:02:34,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:34,858 INFO L225 Difference]: With dead ends: 30767 [2018-12-08 17:02:34,858 INFO L226 Difference]: Without dead ends: 30767 [2018-12-08 17:02:34,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-08 17:02:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30767 states. [2018-12-08 17:02:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30767 to 27531. [2018-12-08 17:02:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27531 states. [2018-12-08 17:02:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27531 states to 27531 states and 83463 transitions. [2018-12-08 17:02:35,170 INFO L78 Accepts]: Start accepts. Automaton has 27531 states and 83463 transitions. Word has length 70 [2018-12-08 17:02:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:35,170 INFO L480 AbstractCegarLoop]: Abstraction has 27531 states and 83463 transitions. [2018-12-08 17:02:35,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:02:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 27531 states and 83463 transitions. [2018-12-08 17:02:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 17:02:35,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:35,179 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-08 17:02:35,179 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:35,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:35,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1513089993, now seen corresponding path program 1 times [2018-12-08 17:02:35,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:35,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:35,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:35,216 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-08 17:02:35,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:35,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:02:35,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:35,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:02:35,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:02:35,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:02:35,217 INFO L87 Difference]: Start difference. First operand 27531 states and 83463 transitions. Second operand 4 states. [2018-12-08 17:02:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:35,611 INFO L93 Difference]: Finished difference Result 37927 states and 115324 transitions. [2018-12-08 17:02:35,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:02:35,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-08 17:02:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:35,654 INFO L225 Difference]: With dead ends: 37927 [2018-12-08 17:02:35,654 INFO L226 Difference]: Without dead ends: 37711 [2018-12-08 17:02:35,654 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-08 17:02:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37711 states. [2018-12-08 17:02:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37711 to 34931. [2018-12-08 17:02:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34931 states. [2018-12-08 17:02:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34931 states to 34931 states and 106353 transitions. [2018-12-08 17:02:36,156 INFO L78 Accepts]: Start accepts. Automaton has 34931 states and 106353 transitions. Word has length 70 [2018-12-08 17:02:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:36,156 INFO L480 AbstractCegarLoop]: Abstraction has 34931 states and 106353 transitions. [2018-12-08 17:02:36,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:02:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 34931 states and 106353 transitions. [2018-12-08 17:02:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 17:02:36,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:36,165 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-08 17:02:36,165 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:36,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:36,166 INFO L82 PathProgramCache]: Analyzing trace with hash 984925944, now seen corresponding path program 1 times [2018-12-08 17:02:36,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:36,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:36,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:36,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:36,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:36,263 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-08 17:02:36,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:36,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:02:36,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:36,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:02:36,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:02:36,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:02:36,264 INFO L87 Difference]: Start difference. First operand 34931 states and 106353 transitions. Second operand 7 states. [2018-12-08 17:02:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:36,599 INFO L93 Difference]: Finished difference Result 30943 states and 89976 transitions. [2018-12-08 17:02:36,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:02:36,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-08 17:02:36,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:36,633 INFO L225 Difference]: With dead ends: 30943 [2018-12-08 17:02:36,633 INFO L226 Difference]: Without dead ends: 30943 [2018-12-08 17:02:36,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:02:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2018-12-08 17:02:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 25023. [2018-12-08 17:02:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25023 states. [2018-12-08 17:02:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25023 states to 25023 states and 72808 transitions. [2018-12-08 17:02:36,925 INFO L78 Accepts]: Start accepts. Automaton has 25023 states and 72808 transitions. Word has length 70 [2018-12-08 17:02:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:36,925 INFO L480 AbstractCegarLoop]: Abstraction has 25023 states and 72808 transitions. [2018-12-08 17:02:36,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:02:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 25023 states and 72808 transitions. [2018-12-08 17:02:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 17:02:36,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:36,933 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-08 17:02:36,933 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:36,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:36,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1872429625, now seen corresponding path program 1 times [2018-12-08 17:02:36,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:36,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:36,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:36,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:36,966 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-08 17:02:36,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:36,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:02:36,966 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:36,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:02:36,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:02:36,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:36,967 INFO L87 Difference]: Start difference. First operand 25023 states and 72808 transitions. Second operand 5 states. [2018-12-08 17:02:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:37,000 INFO L93 Difference]: Finished difference Result 7111 states and 17702 transitions. [2018-12-08 17:02:37,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:02:37,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-08 17:02:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:37,005 INFO L225 Difference]: With dead ends: 7111 [2018-12-08 17:02:37,005 INFO L226 Difference]: Without dead ends: 5778 [2018-12-08 17:02:37,005 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-08 17:02:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2018-12-08 17:02:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 5211. [2018-12-08 17:02:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5211 states. [2018-12-08 17:02:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5211 states to 5211 states and 12576 transitions. [2018-12-08 17:02:37,044 INFO L78 Accepts]: Start accepts. Automaton has 5211 states and 12576 transitions. Word has length 70 [2018-12-08 17:02:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:37,044 INFO L480 AbstractCegarLoop]: Abstraction has 5211 states and 12576 transitions. [2018-12-08 17:02:37,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:02:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 5211 states and 12576 transitions. [2018-12-08 17:02:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 17:02:37,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:37,048 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-08 17:02:37,048 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:37,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:37,048 INFO L82 PathProgramCache]: Analyzing trace with hash -173742318, now seen corresponding path program 1 times [2018-12-08 17:02:37,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:37,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:37,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:37,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:37,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:37,070 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-08 17:02:37,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:37,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:02:37,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:37,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:02:37,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:02:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:02:37,071 INFO L87 Difference]: Start difference. First operand 5211 states and 12576 transitions. Second operand 3 states. [2018-12-08 17:02:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:37,097 INFO L93 Difference]: Finished difference Result 6743 states and 16083 transitions. [2018-12-08 17:02:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:02:37,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-08 17:02:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:37,102 INFO L225 Difference]: With dead ends: 6743 [2018-12-08 17:02:37,102 INFO L226 Difference]: Without dead ends: 6743 [2018-12-08 17:02:37,103 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-08 17:02:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2018-12-08 17:02:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 5112. [2018-12-08 17:02:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5112 states. [2018-12-08 17:02:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 12061 transitions. [2018-12-08 17:02:37,143 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 12061 transitions. Word has length 70 [2018-12-08 17:02:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:37,143 INFO L480 AbstractCegarLoop]: Abstraction has 5112 states and 12061 transitions. [2018-12-08 17:02:37,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:02:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 12061 transitions. [2018-12-08 17:02:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-08 17:02:37,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:37,147 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] [2018-12-08 17:02:37,147 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:37,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:37,147 INFO L82 PathProgramCache]: Analyzing trace with hash 536084869, now seen corresponding path program 1 times [2018-12-08 17:02:37,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:37,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:37,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:37,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:37,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:37,186 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-08 17:02:37,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:37,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:02:37,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:37,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:02:37,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:02:37,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:37,187 INFO L87 Difference]: Start difference. First operand 5112 states and 12061 transitions. Second operand 5 states. [2018-12-08 17:02:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:37,281 INFO L93 Difference]: Finished difference Result 6146 states and 14511 transitions. [2018-12-08 17:02:37,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:02:37,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-08 17:02:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:37,285 INFO L225 Difference]: With dead ends: 6146 [2018-12-08 17:02:37,285 INFO L226 Difference]: Without dead ends: 6146 [2018-12-08 17:02:37,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:02:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6146 states. [2018-12-08 17:02:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6146 to 5590. [2018-12-08 17:02:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2018-12-08 17:02:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 13219 transitions. [2018-12-08 17:02:37,323 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 13219 transitions. Word has length 76 [2018-12-08 17:02:37,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:37,324 INFO L480 AbstractCegarLoop]: Abstraction has 5590 states and 13219 transitions. [2018-12-08 17:02:37,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:02:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 13219 transitions. [2018-12-08 17:02:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-08 17:02:37,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:37,327 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] [2018-12-08 17:02:37,327 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:37,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2016072092, now seen corresponding path program 1 times [2018-12-08 17:02:37,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:37,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:37,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:37,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:37,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:37,379 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-08 17:02:37,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:37,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:02:37,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:37,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:02:37,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:02:37,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:02:37,379 INFO L87 Difference]: Start difference. First operand 5590 states and 13219 transitions. Second operand 7 states. [2018-12-08 17:02:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:37,598 INFO L93 Difference]: Finished difference Result 6317 states and 14770 transitions. [2018-12-08 17:02:37,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:02:37,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-08 17:02:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:37,603 INFO L225 Difference]: With dead ends: 6317 [2018-12-08 17:02:37,603 INFO L226 Difference]: Without dead ends: 6215 [2018-12-08 17:02:37,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:02:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6215 states. [2018-12-08 17:02:37,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6215 to 5600. [2018-12-08 17:02:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5600 states. [2018-12-08 17:02:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5600 states to 5600 states and 13149 transitions. [2018-12-08 17:02:37,643 INFO L78 Accepts]: Start accepts. Automaton has 5600 states and 13149 transitions. Word has length 76 [2018-12-08 17:02:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:37,643 INFO L480 AbstractCegarLoop]: Abstraction has 5600 states and 13149 transitions. [2018-12-08 17:02:37,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:02:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5600 states and 13149 transitions. [2018-12-08 17:02:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 17:02:37,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:37,647 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] [2018-12-08 17:02:37,647 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:37,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash -75730611, now seen corresponding path program 1 times [2018-12-08 17:02:37,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:37,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:37,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:37,690 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-08 17:02:37,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:37,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:02:37,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:37,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:02:37,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:02:37,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:02:37,691 INFO L87 Difference]: Start difference. First operand 5600 states and 13149 transitions. Second operand 4 states. [2018-12-08 17:02:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:37,748 INFO L93 Difference]: Finished difference Result 6739 states and 15628 transitions. [2018-12-08 17:02:37,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:02:37,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-08 17:02:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:37,752 INFO L225 Difference]: With dead ends: 6739 [2018-12-08 17:02:37,752 INFO L226 Difference]: Without dead ends: 6739 [2018-12-08 17:02:37,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6739 states. [2018-12-08 17:02:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6739 to 6089. [2018-12-08 17:02:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6089 states. [2018-12-08 17:02:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 14203 transitions. [2018-12-08 17:02:37,794 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 14203 transitions. Word has length 97 [2018-12-08 17:02:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:37,795 INFO L480 AbstractCegarLoop]: Abstraction has 6089 states and 14203 transitions. [2018-12-08 17:02:37,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:02:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 14203 transitions. [2018-12-08 17:02:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:37,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:37,799 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] [2018-12-08 17:02:37,799 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:37,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:37,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2044841943, now seen corresponding path program 1 times [2018-12-08 17:02:37,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:37,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:37,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:37,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:37,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:37,837 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-08 17:02:37,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:37,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:02:37,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:37,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:02:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:02:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:37,838 INFO L87 Difference]: Start difference. First operand 6089 states and 14203 transitions. Second operand 5 states. [2018-12-08 17:02:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:38,165 INFO L93 Difference]: Finished difference Result 12898 states and 29523 transitions. [2018-12-08 17:02:38,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:02:38,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-08 17:02:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:38,174 INFO L225 Difference]: With dead ends: 12898 [2018-12-08 17:02:38,174 INFO L226 Difference]: Without dead ends: 12833 [2018-12-08 17:02:38,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:02:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12833 states. [2018-12-08 17:02:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12833 to 8663. [2018-12-08 17:02:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8663 states. [2018-12-08 17:02:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8663 states to 8663 states and 20190 transitions. [2018-12-08 17:02:38,254 INFO L78 Accepts]: Start accepts. Automaton has 8663 states and 20190 transitions. Word has length 99 [2018-12-08 17:02:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:38,254 INFO L480 AbstractCegarLoop]: Abstraction has 8663 states and 20190 transitions. [2018-12-08 17:02:38,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:02:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 8663 states and 20190 transitions. [2018-12-08 17:02:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:38,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:38,261 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] [2018-12-08 17:02:38,261 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:38,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1105647447, now seen corresponding path program 2 times [2018-12-08 17:02:38,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:38,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:38,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:38,331 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-08 17:02:38,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:38,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:02:38,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:38,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:02:38,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:02:38,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:38,332 INFO L87 Difference]: Start difference. First operand 8663 states and 20190 transitions. Second operand 5 states. [2018-12-08 17:02:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:38,531 INFO L93 Difference]: Finished difference Result 9485 states and 21911 transitions. [2018-12-08 17:02:38,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:02:38,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-08 17:02:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:38,538 INFO L225 Difference]: With dead ends: 9485 [2018-12-08 17:02:38,538 INFO L226 Difference]: Without dead ends: 9420 [2018-12-08 17:02:38,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:02:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9420 states. [2018-12-08 17:02:38,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9420 to 8804. [2018-12-08 17:02:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8804 states. [2018-12-08 17:02:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8804 states to 8804 states and 20386 transitions. [2018-12-08 17:02:38,607 INFO L78 Accepts]: Start accepts. Automaton has 8804 states and 20386 transitions. Word has length 99 [2018-12-08 17:02:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:38,607 INFO L480 AbstractCegarLoop]: Abstraction has 8804 states and 20386 transitions. [2018-12-08 17:02:38,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:02:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 8804 states and 20386 transitions. [2018-12-08 17:02:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:38,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:38,613 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] [2018-12-08 17:02:38,614 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:38,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash 641464689, now seen corresponding path program 3 times [2018-12-08 17:02:38,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:38,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:38,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:02:38,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:38,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:38,695 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-08 17:02:38,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:38,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:02:38,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:38,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:02:38,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:02:38,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:02:38,695 INFO L87 Difference]: Start difference. First operand 8804 states and 20386 transitions. Second operand 8 states. [2018-12-08 17:02:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:39,017 INFO L93 Difference]: Finished difference Result 9946 states and 22949 transitions. [2018-12-08 17:02:39,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:02:39,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-08 17:02:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:39,024 INFO L225 Difference]: With dead ends: 9946 [2018-12-08 17:02:39,024 INFO L226 Difference]: Without dead ends: 9891 [2018-12-08 17:02:39,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:02:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9891 states. [2018-12-08 17:02:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9891 to 7850. [2018-12-08 17:02:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7850 states. [2018-12-08 17:02:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7850 states to 7850 states and 18364 transitions. [2018-12-08 17:02:39,088 INFO L78 Accepts]: Start accepts. Automaton has 7850 states and 18364 transitions. Word has length 99 [2018-12-08 17:02:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:39,089 INFO L480 AbstractCegarLoop]: Abstraction has 7850 states and 18364 transitions. [2018-12-08 17:02:39,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:02:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7850 states and 18364 transitions. [2018-12-08 17:02:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:39,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:39,096 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] [2018-12-08 17:02:39,096 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:39,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:39,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1603078706, now seen corresponding path program 1 times [2018-12-08 17:02:39,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:39,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:39,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:02:39,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:39,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:39,170 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-08 17:02:39,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:39,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:02:39,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:39,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:02:39,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:02:39,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:02:39,171 INFO L87 Difference]: Start difference. First operand 7850 states and 18364 transitions. Second operand 7 states. [2018-12-08 17:02:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:39,455 INFO L93 Difference]: Finished difference Result 9933 states and 23088 transitions. [2018-12-08 17:02:39,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:02:39,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 17:02:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:39,465 INFO L225 Difference]: With dead ends: 9933 [2018-12-08 17:02:39,465 INFO L226 Difference]: Without dead ends: 9854 [2018-12-08 17:02:39,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:02:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9854 states. [2018-12-08 17:02:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9854 to 8258. [2018-12-08 17:02:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2018-12-08 17:02:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 19297 transitions. [2018-12-08 17:02:39,555 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 19297 transitions. Word has length 99 [2018-12-08 17:02:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:39,555 INFO L480 AbstractCegarLoop]: Abstraction has 8258 states and 19297 transitions. [2018-12-08 17:02:39,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:02:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 19297 transitions. [2018-12-08 17:02:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:39,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:39,560 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] [2018-12-08 17:02:39,560 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:39,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:39,561 INFO L82 PathProgramCache]: Analyzing trace with hash -474130637, now seen corresponding path program 1 times [2018-12-08 17:02:39,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:39,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:39,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:39,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:39,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:39,651 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-08 17:02:39,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:39,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:02:39,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:39,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:02:39,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:02:39,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:02:39,652 INFO L87 Difference]: Start difference. First operand 8258 states and 19297 transitions. Second operand 7 states. [2018-12-08 17:02:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:40,039 INFO L93 Difference]: Finished difference Result 12648 states and 29446 transitions. [2018-12-08 17:02:40,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:02:40,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 17:02:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:40,049 INFO L225 Difference]: With dead ends: 12648 [2018-12-08 17:02:40,049 INFO L226 Difference]: Without dead ends: 12621 [2018-12-08 17:02:40,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:02:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12621 states. [2018-12-08 17:02:40,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12621 to 8518. [2018-12-08 17:02:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2018-12-08 17:02:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 19866 transitions. [2018-12-08 17:02:40,134 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 19866 transitions. Word has length 99 [2018-12-08 17:02:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:40,134 INFO L480 AbstractCegarLoop]: Abstraction has 8518 states and 19866 transitions. [2018-12-08 17:02:40,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:02:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 19866 transitions. [2018-12-08 17:02:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:40,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:40,140 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] [2018-12-08 17:02:40,140 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:40,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:40,140 INFO L82 PathProgramCache]: Analyzing trace with hash -299825098, now seen corresponding path program 1 times [2018-12-08 17:02:40,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:40,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:40,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:40,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:40,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:40,235 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-08 17:02:40,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:40,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:02:40,236 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:40,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:02:40,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:02:40,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:02:40,236 INFO L87 Difference]: Start difference. First operand 8518 states and 19866 transitions. Second operand 8 states. [2018-12-08 17:02:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:40,633 INFO L93 Difference]: Finished difference Result 12545 states and 28550 transitions. [2018-12-08 17:02:40,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 17:02:40,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-08 17:02:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:40,642 INFO L225 Difference]: With dead ends: 12545 [2018-12-08 17:02:40,642 INFO L226 Difference]: Without dead ends: 12404 [2018-12-08 17:02:40,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:02:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12404 states. [2018-12-08 17:02:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12404 to 8975. [2018-12-08 17:02:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8975 states. [2018-12-08 17:02:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8975 states to 8975 states and 20892 transitions. [2018-12-08 17:02:40,724 INFO L78 Accepts]: Start accepts. Automaton has 8975 states and 20892 transitions. Word has length 99 [2018-12-08 17:02:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:40,724 INFO L480 AbstractCegarLoop]: Abstraction has 8975 states and 20892 transitions. [2018-12-08 17:02:40,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:02:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8975 states and 20892 transitions. [2018-12-08 17:02:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:40,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:40,731 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] [2018-12-08 17:02:40,731 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:40,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:40,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1917932855, now seen corresponding path program 1 times [2018-12-08 17:02:40,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:40,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:40,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:40,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:40,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:40,804 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-08 17:02:40,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:40,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:02:40,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:40,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:02:40,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:02:40,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:02:40,804 INFO L87 Difference]: Start difference. First operand 8975 states and 20892 transitions. Second operand 7 states. [2018-12-08 17:02:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:40,905 INFO L93 Difference]: Finished difference Result 11183 states and 26001 transitions. [2018-12-08 17:02:40,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:02:40,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 17:02:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:40,913 INFO L225 Difference]: With dead ends: 11183 [2018-12-08 17:02:40,913 INFO L226 Difference]: Without dead ends: 11183 [2018-12-08 17:02:40,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:02:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11183 states. [2018-12-08 17:02:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11183 to 8356. [2018-12-08 17:02:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8356 states. [2018-12-08 17:02:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8356 states to 8356 states and 19418 transitions. [2018-12-08 17:02:40,986 INFO L78 Accepts]: Start accepts. Automaton has 8356 states and 19418 transitions. Word has length 99 [2018-12-08 17:02:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:40,986 INFO L480 AbstractCegarLoop]: Abstraction has 8356 states and 19418 transitions. [2018-12-08 17:02:40,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:02:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 8356 states and 19418 transitions. [2018-12-08 17:02:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:40,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:02:40,992 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:40,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:40,993 INFO L82 PathProgramCache]: Analyzing trace with hash -92170986, now seen corresponding path program 1 times [2018-12-08 17:02:40,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:40,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:40,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:40,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:41,055 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-08 17:02:41,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:41,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 17:02:41,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:41,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:02:41,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:02:41,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:02:41,056 INFO L87 Difference]: Start difference. First operand 8356 states and 19418 transitions. Second operand 9 states. [2018-12-08 17:02:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:41,176 INFO L93 Difference]: Finished difference Result 12278 states and 28543 transitions. [2018-12-08 17:02:41,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:02:41,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-08 17:02:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:41,179 INFO L225 Difference]: With dead ends: 12278 [2018-12-08 17:02:41,179 INFO L226 Difference]: Without dead ends: 4133 [2018-12-08 17:02:41,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 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-08 17:02:41,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2018-12-08 17:02:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 4133. [2018-12-08 17:02:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4133 states. [2018-12-08 17:02:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4133 states to 4133 states and 9546 transitions. [2018-12-08 17:02:41,203 INFO L78 Accepts]: Start accepts. Automaton has 4133 states and 9546 transitions. Word has length 99 [2018-12-08 17:02:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:41,203 INFO L480 AbstractCegarLoop]: Abstraction has 4133 states and 9546 transitions. [2018-12-08 17:02:41,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:02:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4133 states and 9546 transitions. [2018-12-08 17:02:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:41,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:41,206 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] [2018-12-08 17:02:41,206 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:41,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:41,206 INFO L82 PathProgramCache]: Analyzing trace with hash -653257639, now seen corresponding path program 1 times [2018-12-08 17:02:41,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:41,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:41,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:41,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:41,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:41,261 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-08 17:02:41,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:41,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:02:41,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:41,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:02:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:02:41,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:02:41,262 INFO L87 Difference]: Start difference. First operand 4133 states and 9546 transitions. Second operand 7 states. [2018-12-08 17:02:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:41,433 INFO L93 Difference]: Finished difference Result 4443 states and 10224 transitions. [2018-12-08 17:02:41,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:02:41,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 17:02:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:41,436 INFO L225 Difference]: With dead ends: 4443 [2018-12-08 17:02:41,436 INFO L226 Difference]: Without dead ends: 4443 [2018-12-08 17:02:41,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:02:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2018-12-08 17:02:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4109. [2018-12-08 17:02:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4109 states. [2018-12-08 17:02:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 9502 transitions. [2018-12-08 17:02:41,463 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 9502 transitions. Word has length 99 [2018-12-08 17:02:41,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:41,463 INFO L480 AbstractCegarLoop]: Abstraction has 4109 states and 9502 transitions. [2018-12-08 17:02:41,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:02:41,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 9502 transitions. [2018-12-08 17:02:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:41,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:41,465 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] [2018-12-08 17:02:41,466 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:41,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash 659390049, now seen corresponding path program 1 times [2018-12-08 17:02:41,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:41,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:41,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:41,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:41,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:41,522 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-08 17:02:41,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:41,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:02:41,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:41,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:02:41,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:02:41,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:41,522 INFO L87 Difference]: Start difference. First operand 4109 states and 9502 transitions. Second operand 5 states. [2018-12-08 17:02:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:41,544 INFO L93 Difference]: Finished difference Result 4109 states and 9486 transitions. [2018-12-08 17:02:41,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:02:41,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-08 17:02:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:41,547 INFO L225 Difference]: With dead ends: 4109 [2018-12-08 17:02:41,547 INFO L226 Difference]: Without dead ends: 4109 [2018-12-08 17:02:41,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:02:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2018-12-08 17:02:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 3771. [2018-12-08 17:02:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3771 states. [2018-12-08 17:02:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 8676 transitions. [2018-12-08 17:02:41,582 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 8676 transitions. Word has length 99 [2018-12-08 17:02:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:41,582 INFO L480 AbstractCegarLoop]: Abstraction has 3771 states and 8676 transitions. [2018-12-08 17:02:41,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:02:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 8676 transitions. [2018-12-08 17:02:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:41,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:41,585 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] [2018-12-08 17:02:41,586 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:41,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:41,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1546893730, now seen corresponding path program 2 times [2018-12-08 17:02:41,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:41,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:41,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:41,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:41,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:41,713 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-08 17:02:41,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:41,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 17:02:41,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:02:41,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:02:41,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:02:41,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:02:41,714 INFO L87 Difference]: Start difference. First operand 3771 states and 8676 transitions. Second operand 11 states. [2018-12-08 17:02:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:42,215 INFO L93 Difference]: Finished difference Result 7868 states and 18214 transitions. [2018-12-08 17:02:42,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:02:42,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-12-08 17:02:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:42,220 INFO L225 Difference]: With dead ends: 7868 [2018-12-08 17:02:42,220 INFO L226 Difference]: Without dead ends: 5124 [2018-12-08 17:02:42,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:02:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2018-12-08 17:02:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 3802. [2018-12-08 17:02:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3802 states. [2018-12-08 17:02:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 8692 transitions. [2018-12-08 17:02:42,258 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 8692 transitions. Word has length 99 [2018-12-08 17:02:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:42,258 INFO L480 AbstractCegarLoop]: Abstraction has 3802 states and 8692 transitions. [2018-12-08 17:02:42,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:02:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 8692 transitions. [2018-12-08 17:02:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:02:42,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:42,261 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] [2018-12-08 17:02:42,261 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:42,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash -275361982, now seen corresponding path program 3 times [2018-12-08 17:02:42,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:02:42,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:42,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:02:42,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:02:42,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:02:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:02:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:02:42,310 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 17:02:42,411 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 17:02:42,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:02:42 BasicIcfg [2018-12-08 17:02:42,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:02:42,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:02:42,413 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:02:42,413 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:02:42,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:02:26" (3/4) ... [2018-12-08 17:02:42,415 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 17:02:42,517 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6b31c62c-9026-45f7-97f8-60d16287e981/bin-2019/utaipan/witness.graphml [2018-12-08 17:02:42,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:02:42,518 INFO L168 Benchmark]: Toolchain (without parser) took 16865.37 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 956.0 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-08 17:02:42,519 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:02:42,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.2 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -86.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:02:42,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:02:42,520 INFO L168 Benchmark]: Boogie Preprocessor took 18.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:02:42,520 INFO L168 Benchmark]: RCFGBuilder took 321.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.8 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:02:42,520 INFO L168 Benchmark]: TraceAbstraction took 16002.80 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 992.8 MB in the beginning and 541.2 MB in the end (delta: 451.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-08 17:02:42,521 INFO L168 Benchmark]: Witness Printer took 104.61 ms. Allocated memory was 2.6 GB in the beginning and 2.7 GB in the end (delta: 46.1 MB). Free memory was 541.2 MB in the beginning and 2.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. [2018-12-08 17:02:42,522 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.2 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -86.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 321.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.8 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16002.80 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 992.8 MB in the beginning and 541.2 MB in the end (delta: 451.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 104.61 ms. Allocated memory was 2.6 GB in the beginning and 2.7 GB in the end (delta: 46.1 MB). Free memory was 541.2 MB in the beginning and 2.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L682] -1 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L683] -1 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L684] -1 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L685] -1 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L686] -1 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L687] -1 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L688] -1 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L689] -1 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L690] -1 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L691] -1 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L692] -1 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L693] -1 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L694] -1 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L695] -1 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L696] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L697] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L699] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L704] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L705] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L790] -1 pthread_t t847; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t847, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L709] 0 a$w_buff1 = a$w_buff0 [L710] 0 a$w_buff0 = 1 [L711] 0 a$w_buff1_used = a$w_buff0_used [L712] 0 a$w_buff0_used = (_Bool)1 [L792] -1 pthread_t t848; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t848, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L714] 0 a$r_buff1_thd0 = a$r_buff0_thd0 [L715] 0 a$r_buff1_thd1 = a$r_buff0_thd1 [L716] 0 a$r_buff1_thd2 = a$r_buff0_thd2 [L717] 0 a$r_buff0_thd1 = (_Bool)1 [L720] 0 x = 1 [L723] 0 __unbuffered_p0_EAX = x [L726] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L729] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L743] 1 y = 1 [L746] 1 z = 1 [L749] 1 __unbuffered_p1_EAX = z [L752] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L753] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L754] 1 a$flush_delayed = weak$$choice2 [L755] 1 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L756] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L729] 0 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L730] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L756] 1 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L730] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L731] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L731] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L757] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] 0 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L733] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L733] 0 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L736] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L757] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L758] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L758] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L759] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L759] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L760] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L760] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L761] 1 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L762] EXPR 1 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L762] 1 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 1 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L764] EXPR 1 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$flush_delayed ? a$mem_tmp : a [L765] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] -1 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L800] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L800] -1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L801] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L801] -1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L802] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L802] -1 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L803] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L803] -1 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L806] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 226 locations, 3 error locations. UNSAFE Result, 15.9s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8150 SDtfs, 8780 SDslu, 18531 SDs, 0 SdLazy, 7536 SolverSat, 449 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 79 SyntacticMatches, 26 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34931occurred 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: 4.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 78523 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2435 NumberOfCodeBlocks, 2435 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2306 ConstructedInterpolants, 0 QuantifiedInterpolants, 534933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...