./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/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 11fa2b8d910d21555da4623eb76d0ce1a4371d15 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:00:37,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:00:37,483 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:00:37,489 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:00:37,489 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:00:37,489 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:00:37,490 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:00:37,491 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:00:37,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:00:37,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:00:37,492 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:00:37,492 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:00:37,493 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:00:37,493 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:00:37,494 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:00:37,494 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:00:37,494 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:00:37,495 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:00:37,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:00:37,497 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:00:37,497 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:00:37,498 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:00:37,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:00:37,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:00:37,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:00:37,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:00:37,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:00:37,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:00:37,500 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:00:37,501 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:00:37,501 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:00:37,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:00:37,501 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:00:37,502 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:00:37,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:00:37,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:00:37,502 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:00:37,509 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:00:37,509 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:00:37,510 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:00:37,510 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:00:37,510 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:00:37,510 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:00:37,510 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:00:37,510 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:00:37,510 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:00:37,510 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:00:37,510 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:00:37,510 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:00:37,511 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:00:37,511 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:00:37,511 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:00:37,511 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:00:37,511 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:00:37,511 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:00:37,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:00:37,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:00:37,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:00:37,512 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:00:37,512 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:00:37,512 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:00:37,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:00:37,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:00:37,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:00:37,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:00:37,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:00:37,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:00:37,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:00:37,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:00:37,512 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:00:37,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:00:37,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:00:37,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:00:37,513 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_747bee74-19e5-4f2d-a675-c06d8f01523f/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 -> 11fa2b8d910d21555da4623eb76d0ce1a4371d15 [2018-12-09 19:00:37,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:00:37,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:00:37,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:00:37,543 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:00:37,543 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:00:37,544 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_false-unreach-call.i [2018-12-09 19:00:37,583 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/data/7e6c0700f/bb2030051bef435eafb4a5830e0a0d07/FLAGf59994604 [2018-12-09 19:00:38,016 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:00:38,016 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/sv-benchmarks/c/pthread-wmm/mix056_power.opt_false-unreach-call.i [2018-12-09 19:00:38,023 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/data/7e6c0700f/bb2030051bef435eafb4a5830e0a0d07/FLAGf59994604 [2018-12-09 19:00:38,031 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/data/7e6c0700f/bb2030051bef435eafb4a5830e0a0d07 [2018-12-09 19:00:38,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:00:38,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:00:38,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:00:38,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:00:38,037 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:00:38,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:00:38" (1/1) ... [2018-12-09 19:00:38,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38, skipping insertion in model container [2018-12-09 19:00:38,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:00:38" (1/1) ... [2018-12-09 19:00:38,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:00:38,070 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:00:38,273 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:00:38,281 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:00:38,352 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:00:38,381 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:00:38,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38 WrapperNode [2018-12-09 19:00:38,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:00:38,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:00:38,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:00:38,382 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:00:38,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38" (1/1) ... [2018-12-09 19:00:38,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38" (1/1) ... [2018-12-09 19:00:38,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:00:38,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:00:38,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:00:38,414 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:00:38,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38" (1/1) ... [2018-12-09 19:00:38,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38" (1/1) ... [2018-12-09 19:00:38,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38" (1/1) ... [2018-12-09 19:00:38,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38" (1/1) ... [2018-12-09 19:00:38,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38" (1/1) ... [2018-12-09 19:00:38,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38" (1/1) ... [2018-12-09 19:00:38,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38" (1/1) ... [2018-12-09 19:00:38,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:00:38,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:00:38,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:00:38,433 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:00:38,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:00:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:00:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:00:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 19:00:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:00:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 19:00:38,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 19:00:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 19:00:38,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 19:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 19:00:38,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 19:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 19:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:00:38,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:00:38,468 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 19:00:38,759 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:00:38,759 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 19:00:38,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:00:38 BoogieIcfgContainer [2018-12-09 19:00:38,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:00:38,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:00:38,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:00:38,762 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:00:38,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:00:38" (1/3) ... [2018-12-09 19:00:38,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70442cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:00:38, skipping insertion in model container [2018-12-09 19:00:38,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:00:38" (2/3) ... [2018-12-09 19:00:38,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70442cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:00:38, skipping insertion in model container [2018-12-09 19:00:38,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:00:38" (3/3) ... [2018-12-09 19:00:38,764 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_false-unreach-call.i [2018-12-09 19:00:38,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,786 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,786 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,787 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,787 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,787 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,787 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,787 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,788 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,788 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,788 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,788 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,788 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,788 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,789 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,789 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,789 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,789 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,789 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,789 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,790 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,790 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,790 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,790 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,790 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,790 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,791 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,791 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,791 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,791 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,791 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,791 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,791 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,792 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,792 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,792 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,792 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,792 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,793 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,793 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,793 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,793 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,793 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,793 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,793 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,794 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,794 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,794 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,794 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,794 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,794 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,795 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,795 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,795 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,795 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,795 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,795 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,796 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,796 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,796 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,796 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,796 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,796 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,796 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,797 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,797 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,797 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,797 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,797 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,797 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,797 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,798 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,798 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,798 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,798 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:00:38,803 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:00:38,803 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:00:38,809 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:00:38,818 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:00:38,832 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:00:38,832 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:00:38,832 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:00:38,832 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:00:38,833 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:00:38,833 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:00:38,833 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:00:38,833 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:00:38,839 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-09 19:00:53,685 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-09 19:00:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-09 19:00:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 19:00:53,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:00:53,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:00:53,696 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:00:53,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:00:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-09 19:00:53,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:00:53,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:00:53,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:00:53,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:00:53,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:00:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:00:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:00:53,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:00:53,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:00:53,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:00:53,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:00:53,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:00:53,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:00:53,879 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-09 19:00:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:00:55,431 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-09 19:00:55,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:00:55,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 19:00:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:00:56,222 INFO L225 Difference]: With dead ends: 233472 [2018-12-09 19:00:56,223 INFO L226 Difference]: Without dead ends: 203722 [2018-12-09 19:00:56,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:00:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-09 19:01:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-09 19:01:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 19:01:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-09 19:01:01,644 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-09 19:01:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:01:01,645 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-09 19:01:01,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:01:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-09 19:01:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:01:01,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:01:01,652 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-09 19:01:01,653 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:01:01,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:01:01,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-09 19:01:01,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:01:01,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:01,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:01:01,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:01,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:01:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:01:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:01:01,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:01:01,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:01:01,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:01:01,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:01:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:01:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:01:01,703 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-09 19:01:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:01:02,273 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-09 19:01:02,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:01:02,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 19:01:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:01:02,617 INFO L225 Difference]: With dead ends: 118892 [2018-12-09 19:01:02,617 INFO L226 Difference]: Without dead ends: 118892 [2018-12-09 19:01:02,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:01:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-09 19:01:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-09 19:01:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 19:01:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-09 19:01:05,208 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-09 19:01:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:01:05,209 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-09 19:01:05,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:01:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-09 19:01:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:01:05,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:01:05,212 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-09 19:01:05,212 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:01:05,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:01:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1302381044, now seen corresponding path program 1 times [2018-12-09 19:01:05,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:01:05,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:05,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:01:05,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:05,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:01:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:01:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:01:05,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:01:05,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:01:05,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:01:05,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:01:05,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:01:05,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:01:05,255 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-09 19:01:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:01:08,645 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-09 19:01:08,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:01:08,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 19:01:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:01:09,500 INFO L225 Difference]: With dead ends: 325272 [2018-12-09 19:01:09,500 INFO L226 Difference]: Without dead ends: 324272 [2018-12-09 19:01:09,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:01:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-09 19:01:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-09 19:01:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-09 19:01:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-09 19:01:14,227 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-09 19:01:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:01:14,228 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-09 19:01:14,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:01:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-09 19:01:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 19:01:14,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:01:14,232 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] [2018-12-09 19:01:14,233 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:01:14,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:01:14,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-09 19:01:14,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:01:14,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:14,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:01:14,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:14,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:01:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:01:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:01:14,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:01:14,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:01:14,277 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:01:14,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:01:14,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:01:14,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:01:14,278 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 5 states. [2018-12-09 19:01:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:01:16,370 INFO L93 Difference]: Finished difference Result 334052 states and 1500993 transitions. [2018-12-09 19:01:16,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:01:16,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-09 19:01:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:01:17,281 INFO L225 Difference]: With dead ends: 334052 [2018-12-09 19:01:17,281 INFO L226 Difference]: Without dead ends: 333002 [2018-12-09 19:01:17,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:01:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333002 states. [2018-12-09 19:01:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333002 to 194882. [2018-12-09 19:01:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194882 states. [2018-12-09 19:01:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194882 states to 194882 states and 876472 transitions. [2018-12-09 19:01:24,958 INFO L78 Accepts]: Start accepts. Automaton has 194882 states and 876472 transitions. Word has length 51 [2018-12-09 19:01:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:01:24,958 INFO L480 AbstractCegarLoop]: Abstraction has 194882 states and 876472 transitions. [2018-12-09 19:01:24,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:01:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 194882 states and 876472 transitions. [2018-12-09 19:01:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:01:24,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:01:24,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:01:24,981 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:01:24,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:01:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1402455913, now seen corresponding path program 1 times [2018-12-09 19:01:24,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:01:24,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:24,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:01:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:24,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:01:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:01:25,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-09 19:01:25,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:01:25,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:01:25,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:01:25,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:01:25,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:01:25,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:01:25,034 INFO L87 Difference]: Start difference. First operand 194882 states and 876472 transitions. Second operand 6 states. [2018-12-09 19:01:27,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:01:27,338 INFO L93 Difference]: Finished difference Result 342292 states and 1509975 transitions. [2018-12-09 19:01:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:01:27,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 19:01:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:01:28,218 INFO L225 Difference]: With dead ends: 342292 [2018-12-09 19:01:28,218 INFO L226 Difference]: Without dead ends: 341292 [2018-12-09 19:01:28,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:01:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341292 states. [2018-12-09 19:01:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341292 to 189132. [2018-12-09 19:01:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189132 states. [2018-12-09 19:01:36,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189132 states to 189132 states and 850672 transitions. [2018-12-09 19:01:36,011 INFO L78 Accepts]: Start accepts. Automaton has 189132 states and 850672 transitions. Word has length 58 [2018-12-09 19:01:36,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:01:36,012 INFO L480 AbstractCegarLoop]: Abstraction has 189132 states and 850672 transitions. [2018-12-09 19:01:36,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:01:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 189132 states and 850672 transitions. [2018-12-09 19:01:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:01:36,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:01:36,080 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] [2018-12-09 19:01:36,080 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:01:36,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:01:36,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1292775433, now seen corresponding path program 1 times [2018-12-09 19:01:36,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:01:36,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:36,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:01:36,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:36,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:01:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:01:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:01:36,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:01:36,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:01:36,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:01:36,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:01:36,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:01:36,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:01:36,142 INFO L87 Difference]: Start difference. First operand 189132 states and 850672 transitions. Second operand 5 states. [2018-12-09 19:01:38,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:01:38,157 INFO L93 Difference]: Finished difference Result 312432 states and 1393397 transitions. [2018-12-09 19:01:38,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:01:38,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 19:01:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:01:38,970 INFO L225 Difference]: With dead ends: 312432 [2018-12-09 19:01:38,970 INFO L226 Difference]: Without dead ends: 311792 [2018-12-09 19:01:38,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-09 19:01:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311792 states. [2018-12-09 19:01:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311792 to 298522. [2018-12-09 19:01:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298522 states. [2018-12-09 19:01:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298522 states to 298522 states and 1334099 transitions. [2018-12-09 19:01:48,017 INFO L78 Accepts]: Start accepts. Automaton has 298522 states and 1334099 transitions. Word has length 65 [2018-12-09 19:01:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:01:48,017 INFO L480 AbstractCegarLoop]: Abstraction has 298522 states and 1334099 transitions. [2018-12-09 19:01:48,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:01:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 298522 states and 1334099 transitions. [2018-12-09 19:01:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:01:48,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:01:48,125 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] [2018-12-09 19:01:48,126 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:01:48,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:01:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2024042264, now seen corresponding path program 1 times [2018-12-09 19:01:48,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:01:48,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:48,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:01:48,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:01:48,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:01:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:01:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:01:48,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:01:48,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:01:48,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:01:48,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:01:48,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:01:48,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:01:48,184 INFO L87 Difference]: Start difference. First operand 298522 states and 1334099 transitions. Second operand 6 states. [2018-12-09 19:01:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:01:52,149 INFO L93 Difference]: Finished difference Result 617312 states and 2720261 transitions. [2018-12-09 19:01:52,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:01:52,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 19:01:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:01:58,426 INFO L225 Difference]: With dead ends: 617312 [2018-12-09 19:01:58,426 INFO L226 Difference]: Without dead ends: 615712 [2018-12-09 19:01:58,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:02:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615712 states. [2018-12-09 19:02:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615712 to 353817. [2018-12-09 19:02:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353817 states. [2018-12-09 19:02:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353817 states to 353817 states and 1566315 transitions. [2018-12-09 19:02:07,475 INFO L78 Accepts]: Start accepts. Automaton has 353817 states and 1566315 transitions. Word has length 65 [2018-12-09 19:02:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:07,475 INFO L480 AbstractCegarLoop]: Abstraction has 353817 states and 1566315 transitions. [2018-12-09 19:02:07,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:02:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 353817 states and 1566315 transitions. [2018-12-09 19:02:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:02:07,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:07,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:02:07,653 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:07,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:07,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1275093964, now seen corresponding path program 1 times [2018-12-09 19:02:07,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:07,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:07,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:07,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:07,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:07,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:07,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:07,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:07,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:07,684 INFO L87 Difference]: Start difference. First operand 353817 states and 1566315 transitions. Second operand 3 states. [2018-12-09 19:02:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:10,291 INFO L93 Difference]: Finished difference Result 438907 states and 1917857 transitions. [2018-12-09 19:02:10,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:10,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 19:02:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:11,955 INFO L225 Difference]: With dead ends: 438907 [2018-12-09 19:02:11,955 INFO L226 Difference]: Without dead ends: 438907 [2018-12-09 19:02:11,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438907 states. [2018-12-09 19:02:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438907 to 375852. [2018-12-09 19:02:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375852 states. [2018-12-09 19:02:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375852 states to 375852 states and 1658793 transitions. [2018-12-09 19:02:23,830 INFO L78 Accepts]: Start accepts. Automaton has 375852 states and 1658793 transitions. Word has length 67 [2018-12-09 19:02:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:23,830 INFO L480 AbstractCegarLoop]: Abstraction has 375852 states and 1658793 transitions. [2018-12-09 19:02:23,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 375852 states and 1658793 transitions. [2018-12-09 19:02:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:02:24,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:24,103 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] [2018-12-09 19:02:24,103 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:24,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:24,103 INFO L82 PathProgramCache]: Analyzing trace with hash -567092309, now seen corresponding path program 1 times [2018-12-09 19:02:24,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:24,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:24,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:24,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:24,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:24,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:24,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:02:24,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:24,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:02:24,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:02:24,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:02:24,148 INFO L87 Difference]: Start difference. First operand 375852 states and 1658793 transitions. Second operand 7 states. [2018-12-09 19:02:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:28,748 INFO L93 Difference]: Finished difference Result 675132 states and 2945642 transitions. [2018-12-09 19:02:28,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:02:28,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-09 19:02:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:35,857 INFO L225 Difference]: With dead ends: 675132 [2018-12-09 19:02:35,857 INFO L226 Difference]: Without dead ends: 673532 [2018-12-09 19:02:35,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:02:37,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673532 states. [2018-12-09 19:02:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673532 to 385502. [2018-12-09 19:02:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385502 states. [2018-12-09 19:02:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385502 states to 385502 states and 1698383 transitions. [2018-12-09 19:02:45,679 INFO L78 Accepts]: Start accepts. Automaton has 385502 states and 1698383 transitions. Word has length 71 [2018-12-09 19:02:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:45,679 INFO L480 AbstractCegarLoop]: Abstraction has 385502 states and 1698383 transitions. [2018-12-09 19:02:45,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:02:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 385502 states and 1698383 transitions. [2018-12-09 19:02:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 19:02:45,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:45,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:02:45,964 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:45,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash 243525730, now seen corresponding path program 1 times [2018-12-09 19:02:45,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:45,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:45,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:45,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:45,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:46,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:46,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:02:46,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:46,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:02:46,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:02:46,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:02:46,021 INFO L87 Difference]: Start difference. First operand 385502 states and 1698383 transitions. Second operand 7 states. [2018-12-09 19:02:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:49,882 INFO L93 Difference]: Finished difference Result 515737 states and 2256101 transitions. [2018-12-09 19:02:49,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:02:49,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-09 19:02:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:51,360 INFO L225 Difference]: With dead ends: 515737 [2018-12-09 19:02:51,360 INFO L226 Difference]: Without dead ends: 514387 [2018-12-09 19:02:51,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:02:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514387 states. [2018-12-09 19:02:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514387 to 389347. [2018-12-09 19:02:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389347 states. [2018-12-09 19:03:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389347 states to 389347 states and 1713924 transitions. [2018-12-09 19:03:01,325 INFO L78 Accepts]: Start accepts. Automaton has 389347 states and 1713924 transitions. Word has length 72 [2018-12-09 19:03:01,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:01,325 INFO L480 AbstractCegarLoop]: Abstraction has 389347 states and 1713924 transitions. [2018-12-09 19:03:01,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:03:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 389347 states and 1713924 transitions. [2018-12-09 19:03:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 19:03:01,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:01,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:01,691 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:03:01,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:01,691 INFO L82 PathProgramCache]: Analyzing trace with hash 146003645, now seen corresponding path program 1 times [2018-12-09 19:03:01,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:01,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:01,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:01,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:01,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:01,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:03:01,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:03:01,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:01,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:03:01,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:03:01,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:03:01,758 INFO L87 Difference]: Start difference. First operand 389347 states and 1713924 transitions. Second operand 6 states. [2018-12-09 19:03:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:08,059 INFO L93 Difference]: Finished difference Result 508422 states and 2226794 transitions. [2018-12-09 19:03:08,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:03:08,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-09 19:03:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:09,513 INFO L225 Difference]: With dead ends: 508422 [2018-12-09 19:03:09,513 INFO L226 Difference]: Without dead ends: 502462 [2018-12-09 19:03:09,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:03:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502462 states. [2018-12-09 19:03:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502462 to 439622. [2018-12-09 19:03:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439622 states. [2018-12-09 19:03:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439622 states to 439622 states and 1937949 transitions. [2018-12-09 19:03:19,415 INFO L78 Accepts]: Start accepts. Automaton has 439622 states and 1937949 transitions. Word has length 74 [2018-12-09 19:03:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:19,415 INFO L480 AbstractCegarLoop]: Abstraction has 439622 states and 1937949 transitions. [2018-12-09 19:03:19,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:03:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 439622 states and 1937949 transitions. [2018-12-09 19:03:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 19:03:19,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:19,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:19,841 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:03:19,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash -137146819, now seen corresponding path program 1 times [2018-12-09 19:03:19,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:19,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:19,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:19,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:19,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:19,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:03:19,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:03:19,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:19,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:03:19,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:03:19,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:03:19,900 INFO L87 Difference]: Start difference. First operand 439622 states and 1937949 transitions. Second operand 7 states. [2018-12-09 19:03:23,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:23,877 INFO L93 Difference]: Finished difference Result 590157 states and 2550697 transitions. [2018-12-09 19:03:23,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:03:23,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 19:03:23,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:25,548 INFO L225 Difference]: With dead ends: 590157 [2018-12-09 19:03:25,548 INFO L226 Difference]: Without dead ends: 590157 [2018-12-09 19:03:25,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:03:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590157 states. [2018-12-09 19:03:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590157 to 542807. [2018-12-09 19:03:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542807 states. [2018-12-09 19:03:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542807 states to 542807 states and 2362207 transitions. [2018-12-09 19:03:41,891 INFO L78 Accepts]: Start accepts. Automaton has 542807 states and 2362207 transitions. Word has length 74 [2018-12-09 19:03:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:41,891 INFO L480 AbstractCegarLoop]: Abstraction has 542807 states and 2362207 transitions. [2018-12-09 19:03:41,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:03:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 542807 states and 2362207 transitions. [2018-12-09 19:03:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 19:03:42,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:42,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:42,441 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:03:42,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1107617662, now seen corresponding path program 1 times [2018-12-09 19:03:42,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:42,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:42,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:03:42,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:03:42,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:42,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:03:42,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:03:42,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:03:42,480 INFO L87 Difference]: Start difference. First operand 542807 states and 2362207 transitions. Second operand 4 states. [2018-12-09 19:03:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:45,148 INFO L93 Difference]: Finished difference Result 469758 states and 2015930 transitions. [2018-12-09 19:03:45,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:03:45,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-09 19:03:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:46,926 INFO L225 Difference]: With dead ends: 469758 [2018-12-09 19:03:46,927 INFO L226 Difference]: Without dead ends: 467053 [2018-12-09 19:03:46,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:03:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467053 states. [2018-12-09 19:03:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467053 to 467053. [2018-12-09 19:03:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467053 states. [2018-12-09 19:04:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467053 states to 467053 states and 2006968 transitions. [2018-12-09 19:04:00,636 INFO L78 Accepts]: Start accepts. Automaton has 467053 states and 2006968 transitions. Word has length 74 [2018-12-09 19:04:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:00,636 INFO L480 AbstractCegarLoop]: Abstraction has 467053 states and 2006968 transitions. [2018-12-09 19:04:00,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:04:00,636 INFO L276 IsEmpty]: Start isEmpty. Operand 467053 states and 2006968 transitions. [2018-12-09 19:04:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 19:04:01,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:01,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:01,091 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:01,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1793024226, now seen corresponding path program 1 times [2018-12-09 19:04:01,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:01,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:01,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:01,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:01,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:01,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:04:01,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:01,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:04:01,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:04:01,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:04:01,130 INFO L87 Difference]: Start difference. First operand 467053 states and 2006968 transitions. Second operand 5 states. [2018-12-09 19:04:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:02,187 INFO L93 Difference]: Finished difference Result 137697 states and 546963 transitions. [2018-12-09 19:04:02,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:04:02,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-09 19:04:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:02,494 INFO L225 Difference]: With dead ends: 137697 [2018-12-09 19:04:02,494 INFO L226 Difference]: Without dead ends: 135305 [2018-12-09 19:04:02,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:04:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135305 states. [2018-12-09 19:04:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135305 to 135245. [2018-12-09 19:04:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135245 states. [2018-12-09 19:04:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135245 states to 135245 states and 537799 transitions. [2018-12-09 19:04:04,702 INFO L78 Accepts]: Start accepts. Automaton has 135245 states and 537799 transitions. Word has length 75 [2018-12-09 19:04:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:04,702 INFO L480 AbstractCegarLoop]: Abstraction has 135245 states and 537799 transitions. [2018-12-09 19:04:04,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:04:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 135245 states and 537799 transitions. [2018-12-09 19:04:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 19:04:04,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:04,830 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] [2018-12-09 19:04:04,831 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:04,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:04,831 INFO L82 PathProgramCache]: Analyzing trace with hash -405984454, now seen corresponding path program 1 times [2018-12-09 19:04:04,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:04,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:04,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:04,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:04,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:04,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:04,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:04:04,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:04,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:04:04,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:04:04,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:04:04,877 INFO L87 Difference]: Start difference. First operand 135245 states and 537799 transitions. Second operand 4 states. [2018-12-09 19:04:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:05,978 INFO L93 Difference]: Finished difference Result 169525 states and 668412 transitions. [2018-12-09 19:04:05,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:04:05,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-09 19:04:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:06,349 INFO L225 Difference]: With dead ends: 169525 [2018-12-09 19:04:06,349 INFO L226 Difference]: Without dead ends: 169525 [2018-12-09 19:04:06,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:04:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169525 states. [2018-12-09 19:04:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169525 to 140469. [2018-12-09 19:04:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140469 states. [2018-12-09 19:04:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140469 states to 140469 states and 557228 transitions. [2018-12-09 19:04:08,733 INFO L78 Accepts]: Start accepts. Automaton has 140469 states and 557228 transitions. Word has length 85 [2018-12-09 19:04:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:08,733 INFO L480 AbstractCegarLoop]: Abstraction has 140469 states and 557228 transitions. [2018-12-09 19:04:08,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:04:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 140469 states and 557228 transitions. [2018-12-09 19:04:08,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 19:04:08,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:08,868 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] [2018-12-09 19:04:08,868 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:08,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:08,868 INFO L82 PathProgramCache]: Analyzing trace with hash -660720999, now seen corresponding path program 1 times [2018-12-09 19:04:08,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:08,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:08,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:08,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:08,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:04:08,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:08,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:04:08,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:04:08,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:04:08,913 INFO L87 Difference]: Start difference. First operand 140469 states and 557228 transitions. Second operand 6 states. [2018-12-09 19:04:09,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:09,001 INFO L93 Difference]: Finished difference Result 20597 states and 70892 transitions. [2018-12-09 19:04:09,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:04:09,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-09 19:04:09,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:09,025 INFO L225 Difference]: With dead ends: 20597 [2018-12-09 19:04:09,026 INFO L226 Difference]: Without dead ends: 18885 [2018-12-09 19:04:09,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:04:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18885 states. [2018-12-09 19:04:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18885 to 18370. [2018-12-09 19:04:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18370 states. [2018-12-09 19:04:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18370 states to 18370 states and 63196 transitions. [2018-12-09 19:04:09,218 INFO L78 Accepts]: Start accepts. Automaton has 18370 states and 63196 transitions. Word has length 85 [2018-12-09 19:04:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:09,219 INFO L480 AbstractCegarLoop]: Abstraction has 18370 states and 63196 transitions. [2018-12-09 19:04:09,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:04:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 18370 states and 63196 transitions. [2018-12-09 19:04:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 19:04:09,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:09,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:09,234 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:09,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash 45027742, now seen corresponding path program 1 times [2018-12-09 19:04:09,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:09,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:09,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:09,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:09,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:04:09,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:09,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:04:09,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:04:09,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:04:09,259 INFO L87 Difference]: Start difference. First operand 18370 states and 63196 transitions. Second operand 3 states. [2018-12-09 19:04:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:09,371 INFO L93 Difference]: Finished difference Result 18790 states and 64462 transitions. [2018-12-09 19:04:09,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:04:09,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 19:04:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:09,394 INFO L225 Difference]: With dead ends: 18790 [2018-12-09 19:04:09,394 INFO L226 Difference]: Without dead ends: 18790 [2018-12-09 19:04:09,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:04:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18790 states. [2018-12-09 19:04:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18790 to 18560. [2018-12-09 19:04:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18560 states. [2018-12-09 19:04:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18560 states to 18560 states and 63768 transitions. [2018-12-09 19:04:10,047 INFO L78 Accepts]: Start accepts. Automaton has 18560 states and 63768 transitions. Word has length 98 [2018-12-09 19:04:10,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:10,047 INFO L480 AbstractCegarLoop]: Abstraction has 18560 states and 63768 transitions. [2018-12-09 19:04:10,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:04:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 18560 states and 63768 transitions. [2018-12-09 19:04:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 19:04:10,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:10,062 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] [2018-12-09 19:04:10,062 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:10,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2023388737, now seen corresponding path program 1 times [2018-12-09 19:04:10,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:10,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:10,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:10,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:10,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:10,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:10,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:04:10,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:10,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:04:10,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:04:10,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:04:10,107 INFO L87 Difference]: Start difference. First operand 18560 states and 63768 transitions. Second operand 5 states. [2018-12-09 19:04:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:10,263 INFO L93 Difference]: Finished difference Result 20705 states and 70469 transitions. [2018-12-09 19:04:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:04:10,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-09 19:04:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:10,288 INFO L225 Difference]: With dead ends: 20705 [2018-12-09 19:04:10,288 INFO L226 Difference]: Without dead ends: 20705 [2018-12-09 19:04:10,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:04:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20705 states. [2018-12-09 19:04:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20705 to 20501. [2018-12-09 19:04:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20501 states. [2018-12-09 19:04:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20501 states to 20501 states and 69869 transitions. [2018-12-09 19:04:10,496 INFO L78 Accepts]: Start accepts. Automaton has 20501 states and 69869 transitions. Word has length 98 [2018-12-09 19:04:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:10,496 INFO L480 AbstractCegarLoop]: Abstraction has 20501 states and 69869 transitions. [2018-12-09 19:04:10,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:04:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 20501 states and 69869 transitions. [2018-12-09 19:04:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 19:04:10,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:10,512 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] [2018-12-09 19:04:10,512 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:10,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:10,512 INFO L82 PathProgramCache]: Analyzing trace with hash -2031148096, now seen corresponding path program 2 times [2018-12-09 19:04:10,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:10,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:10,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:10,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:10,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:10,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:10,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:04:10,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:10,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:04:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:04:10,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:04:10,548 INFO L87 Difference]: Start difference. First operand 20501 states and 69869 transitions. Second operand 4 states. [2018-12-09 19:04:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:10,745 INFO L93 Difference]: Finished difference Result 27185 states and 92953 transitions. [2018-12-09 19:04:10,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:04:10,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 19:04:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:10,779 INFO L225 Difference]: With dead ends: 27185 [2018-12-09 19:04:10,780 INFO L226 Difference]: Without dead ends: 27185 [2018-12-09 19:04:10,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:04:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27185 states. [2018-12-09 19:04:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27185 to 20711. [2018-12-09 19:04:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20711 states. [2018-12-09 19:04:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20711 states to 20711 states and 70497 transitions. [2018-12-09 19:04:11,026 INFO L78 Accepts]: Start accepts. Automaton has 20711 states and 70497 transitions. Word has length 98 [2018-12-09 19:04:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:11,027 INFO L480 AbstractCegarLoop]: Abstraction has 20711 states and 70497 transitions. [2018-12-09 19:04:11,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:04:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 20711 states and 70497 transitions. [2018-12-09 19:04:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:04:11,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:11,043 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:11,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash -834009160, now seen corresponding path program 1 times [2018-12-09 19:04:11,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:11,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:11,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:04:11,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:11,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:11,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:11,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:04:11,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:11,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:04:11,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:04:11,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:04:11,068 INFO L87 Difference]: Start difference. First operand 20711 states and 70497 transitions. Second operand 4 states. [2018-12-09 19:04:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:11,227 INFO L93 Difference]: Finished difference Result 36869 states and 125561 transitions. [2018-12-09 19:04:11,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:04:11,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 19:04:11,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:11,275 INFO L225 Difference]: With dead ends: 36869 [2018-12-09 19:04:11,275 INFO L226 Difference]: Without dead ends: 36869 [2018-12-09 19:04:11,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:04:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36869 states. [2018-12-09 19:04:11,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36869 to 20461. [2018-12-09 19:04:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20461 states. [2018-12-09 19:04:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20461 states to 20461 states and 69372 transitions. [2018-12-09 19:04:11,560 INFO L78 Accepts]: Start accepts. Automaton has 20461 states and 69372 transitions. Word has length 100 [2018-12-09 19:04:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:11,560 INFO L480 AbstractCegarLoop]: Abstraction has 20461 states and 69372 transitions. [2018-12-09 19:04:11,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:04:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 20461 states and 69372 transitions. [2018-12-09 19:04:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:04:11,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:11,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:11,577 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:11,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:11,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2017356457, now seen corresponding path program 1 times [2018-12-09 19:04:11,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:11,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:11,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:11,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:11,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:11,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:11,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:04:11,638 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:11,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:04:11,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:04:11,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:04:11,639 INFO L87 Difference]: Start difference. First operand 20461 states and 69372 transitions. Second operand 6 states. [2018-12-09 19:04:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:11,901 INFO L93 Difference]: Finished difference Result 22461 states and 75447 transitions. [2018-12-09 19:04:11,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:04:11,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 19:04:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:11,925 INFO L225 Difference]: With dead ends: 22461 [2018-12-09 19:04:11,925 INFO L226 Difference]: Without dead ends: 22461 [2018-12-09 19:04:11,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:04:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22461 states. [2018-12-09 19:04:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22461 to 20806. [2018-12-09 19:04:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20806 states. [2018-12-09 19:04:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20806 states to 20806 states and 70433 transitions. [2018-12-09 19:04:12,135 INFO L78 Accepts]: Start accepts. Automaton has 20806 states and 70433 transitions. Word has length 100 [2018-12-09 19:04:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:12,136 INFO L480 AbstractCegarLoop]: Abstraction has 20806 states and 70433 transitions. [2018-12-09 19:04:12,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:04:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 20806 states and 70433 transitions. [2018-12-09 19:04:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:04:12,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:12,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:12,152 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:12,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1047775434, now seen corresponding path program 1 times [2018-12-09 19:04:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:12,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:12,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:12,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:12,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:12,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:04:12,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:12,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:04:12,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:04:12,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:04:12,214 INFO L87 Difference]: Start difference. First operand 20806 states and 70433 transitions. Second operand 6 states. [2018-12-09 19:04:12,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:12,402 INFO L93 Difference]: Finished difference Result 20070 states and 67756 transitions. [2018-12-09 19:04:12,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:04:12,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 19:04:12,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:12,433 INFO L225 Difference]: With dead ends: 20070 [2018-12-09 19:04:12,433 INFO L226 Difference]: Without dead ends: 20070 [2018-12-09 19:04:12,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:04:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20070 states. [2018-12-09 19:04:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20070 to 19676. [2018-12-09 19:04:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19676 states. [2018-12-09 19:04:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19676 states to 19676 states and 66594 transitions. [2018-12-09 19:04:12,630 INFO L78 Accepts]: Start accepts. Automaton has 19676 states and 66594 transitions. Word has length 100 [2018-12-09 19:04:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:12,630 INFO L480 AbstractCegarLoop]: Abstraction has 19676 states and 66594 transitions. [2018-12-09 19:04:12,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:04:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19676 states and 66594 transitions. [2018-12-09 19:04:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:04:12,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:12,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:12,646 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:12,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:12,646 INFO L82 PathProgramCache]: Analyzing trace with hash 34388921, now seen corresponding path program 1 times [2018-12-09 19:04:12,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:12,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:12,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:12,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:12,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:12,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:12,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:04:12,699 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:12,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:04:12,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:04:12,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:04:12,699 INFO L87 Difference]: Start difference. First operand 19676 states and 66594 transitions. Second operand 6 states. [2018-12-09 19:04:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:13,004 INFO L93 Difference]: Finished difference Result 21251 states and 70879 transitions. [2018-12-09 19:04:13,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:04:13,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 19:04:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:13,029 INFO L225 Difference]: With dead ends: 21251 [2018-12-09 19:04:13,029 INFO L226 Difference]: Without dead ends: 20701 [2018-12-09 19:04:13,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:04:13,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20701 states. [2018-12-09 19:04:13,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20701 to 20126. [2018-12-09 19:04:13,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20126 states. [2018-12-09 19:04:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20126 states to 20126 states and 67784 transitions. [2018-12-09 19:04:13,231 INFO L78 Accepts]: Start accepts. Automaton has 20126 states and 67784 transitions. Word has length 100 [2018-12-09 19:04:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:13,232 INFO L480 AbstractCegarLoop]: Abstraction has 20126 states and 67784 transitions. [2018-12-09 19:04:13,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:04:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20126 states and 67784 transitions. [2018-12-09 19:04:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:04:13,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:13,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:13,248 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:13,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1735129400, now seen corresponding path program 1 times [2018-12-09 19:04:13,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:13,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:13,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:13,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:13,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:13,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:13,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:04:13,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:13,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:04:13,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:04:13,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:04:13,314 INFO L87 Difference]: Start difference. First operand 20126 states and 67784 transitions. Second operand 7 states. [2018-12-09 19:04:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:13,504 INFO L93 Difference]: Finished difference Result 21079 states and 70852 transitions. [2018-12-09 19:04:13,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:04:13,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 19:04:13,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:13,529 INFO L225 Difference]: With dead ends: 21079 [2018-12-09 19:04:13,529 INFO L226 Difference]: Without dead ends: 21079 [2018-12-09 19:04:13,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:04:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21079 states. [2018-12-09 19:04:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21079 to 20031. [2018-12-09 19:04:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20031 states. [2018-12-09 19:04:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20031 states to 20031 states and 67508 transitions. [2018-12-09 19:04:13,727 INFO L78 Accepts]: Start accepts. Automaton has 20031 states and 67508 transitions. Word has length 100 [2018-12-09 19:04:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:13,728 INFO L480 AbstractCegarLoop]: Abstraction has 20031 states and 67508 transitions. [2018-12-09 19:04:13,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:04:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 20031 states and 67508 transitions. [2018-12-09 19:04:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:04:13,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:13,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:13,743 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:13,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1148958376, now seen corresponding path program 1 times [2018-12-09 19:04:13,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:13,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:13,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:13,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:13,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:13,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:13,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:04:13,801 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:13,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:04:13,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:04:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:04:13,801 INFO L87 Difference]: Start difference. First operand 20031 states and 67508 transitions. Second operand 5 states. [2018-12-09 19:04:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:13,951 INFO L93 Difference]: Finished difference Result 18687 states and 63075 transitions. [2018-12-09 19:04:13,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:04:13,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 19:04:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:13,974 INFO L225 Difference]: With dead ends: 18687 [2018-12-09 19:04:13,974 INFO L226 Difference]: Without dead ends: 18687 [2018-12-09 19:04:13,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:04:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18687 states. [2018-12-09 19:04:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18687 to 18502. [2018-12-09 19:04:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18502 states. [2018-12-09 19:04:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18502 states to 18502 states and 62557 transitions. [2018-12-09 19:04:14,159 INFO L78 Accepts]: Start accepts. Automaton has 18502 states and 62557 transitions. Word has length 100 [2018-12-09 19:04:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:14,159 INFO L480 AbstractCegarLoop]: Abstraction has 18502 states and 62557 transitions. [2018-12-09 19:04:14,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:04:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 18502 states and 62557 transitions. [2018-12-09 19:04:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:04:14,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:14,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:14,173 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:14,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1210348633, now seen corresponding path program 1 times [2018-12-09 19:04:14,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:14,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:14,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:14,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:14,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:14,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:14,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:04:14,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:14,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:04:14,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:04:14,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:04:14,241 INFO L87 Difference]: Start difference. First operand 18502 states and 62557 transitions. Second operand 6 states. [2018-12-09 19:04:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:14,345 INFO L93 Difference]: Finished difference Result 12422 states and 40685 transitions. [2018-12-09 19:04:14,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:04:14,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 19:04:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:14,359 INFO L225 Difference]: With dead ends: 12422 [2018-12-09 19:04:14,359 INFO L226 Difference]: Without dead ends: 12422 [2018-12-09 19:04:14,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:04:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12422 states. [2018-12-09 19:04:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12422 to 10933. [2018-12-09 19:04:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10933 states. [2018-12-09 19:04:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10933 states to 10933 states and 36071 transitions. [2018-12-09 19:04:14,467 INFO L78 Accepts]: Start accepts. Automaton has 10933 states and 36071 transitions. Word has length 100 [2018-12-09 19:04:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:14,467 INFO L480 AbstractCegarLoop]: Abstraction has 10933 states and 36071 transitions. [2018-12-09 19:04:14,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:04:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 10933 states and 36071 transitions. [2018-12-09 19:04:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:04:14,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:14,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:14,476 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:14,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-09 19:04:14,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:14,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:14,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:14,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:14,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:04:14,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:14,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:04:14,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:04:14,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:04:14,521 INFO L87 Difference]: Start difference. First operand 10933 states and 36071 transitions. Second operand 7 states. [2018-12-09 19:04:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:14,815 INFO L93 Difference]: Finished difference Result 17605 states and 56946 transitions. [2018-12-09 19:04:14,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:04:14,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 19:04:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:14,834 INFO L225 Difference]: With dead ends: 17605 [2018-12-09 19:04:14,834 INFO L226 Difference]: Without dead ends: 17477 [2018-12-09 19:04:14,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:04:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17477 states. [2018-12-09 19:04:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17477 to 13761. [2018-12-09 19:04:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2018-12-09 19:04:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 45019 transitions. [2018-12-09 19:04:14,981 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 45019 transitions. Word has length 102 [2018-12-09 19:04:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:14,981 INFO L480 AbstractCegarLoop]: Abstraction has 13761 states and 45019 transitions. [2018-12-09 19:04:14,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:04:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 45019 transitions. [2018-12-09 19:04:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:04:14,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:14,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, 1, 1, 1] [2018-12-09 19:04:14,992 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:14,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:14,992 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-09 19:04:14,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:14,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:14,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:14,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:14,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:15,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:15,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:04:15,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:15,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:04:15,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:04:15,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:04:15,051 INFO L87 Difference]: Start difference. First operand 13761 states and 45019 transitions. Second operand 6 states. [2018-12-09 19:04:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:15,149 INFO L93 Difference]: Finished difference Result 14001 states and 45411 transitions. [2018-12-09 19:04:15,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:04:15,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 19:04:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:15,165 INFO L225 Difference]: With dead ends: 14001 [2018-12-09 19:04:15,165 INFO L226 Difference]: Without dead ends: 14001 [2018-12-09 19:04:15,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:04:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14001 states. [2018-12-09 19:04:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14001 to 13611. [2018-12-09 19:04:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13611 states. [2018-12-09 19:04:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13611 states to 13611 states and 44349 transitions. [2018-12-09 19:04:15,301 INFO L78 Accepts]: Start accepts. Automaton has 13611 states and 44349 transitions. Word has length 102 [2018-12-09 19:04:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:15,301 INFO L480 AbstractCegarLoop]: Abstraction has 13611 states and 44349 transitions. [2018-12-09 19:04:15,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:04:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 13611 states and 44349 transitions. [2018-12-09 19:04:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:04:15,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:15,312 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:15,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:15,312 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-09 19:04:15,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:15,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:15,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:15,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:15,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:15,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:15,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:04:15,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:15,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:04:15,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:04:15,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:04:15,363 INFO L87 Difference]: Start difference. First operand 13611 states and 44349 transitions. Second operand 6 states. [2018-12-09 19:04:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:15,492 INFO L93 Difference]: Finished difference Result 22583 states and 74515 transitions. [2018-12-09 19:04:15,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:04:15,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 19:04:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:15,518 INFO L225 Difference]: With dead ends: 22583 [2018-12-09 19:04:15,518 INFO L226 Difference]: Without dead ends: 22583 [2018-12-09 19:04:15,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:04:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22583 states. [2018-12-09 19:04:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22583 to 13931. [2018-12-09 19:04:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13931 states. [2018-12-09 19:04:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13931 states to 13931 states and 45215 transitions. [2018-12-09 19:04:15,688 INFO L78 Accepts]: Start accepts. Automaton has 13931 states and 45215 transitions. Word has length 102 [2018-12-09 19:04:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:15,688 INFO L480 AbstractCegarLoop]: Abstraction has 13931 states and 45215 transitions. [2018-12-09 19:04:15,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:04:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 13931 states and 45215 transitions. [2018-12-09 19:04:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:04:15,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:15,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:15,700 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:15,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash -597334546, now seen corresponding path program 2 times [2018-12-09 19:04:15,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:15,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:15,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:15,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:15,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:15,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:15,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:15,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:04:15,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:15,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:04:15,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:04:15,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:04:15,763 INFO L87 Difference]: Start difference. First operand 13931 states and 45215 transitions. Second operand 7 states. [2018-12-09 19:04:15,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:15,978 INFO L93 Difference]: Finished difference Result 13991 states and 45363 transitions. [2018-12-09 19:04:15,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:04:15,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 19:04:15,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:15,992 INFO L225 Difference]: With dead ends: 13991 [2018-12-09 19:04:15,992 INFO L226 Difference]: Without dead ends: 13991 [2018-12-09 19:04:15,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:04:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13991 states. [2018-12-09 19:04:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13991 to 13931. [2018-12-09 19:04:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13931 states. [2018-12-09 19:04:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13931 states to 13931 states and 45200 transitions. [2018-12-09 19:04:16,125 INFO L78 Accepts]: Start accepts. Automaton has 13931 states and 45200 transitions. Word has length 102 [2018-12-09 19:04:16,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:16,125 INFO L480 AbstractCegarLoop]: Abstraction has 13931 states and 45200 transitions. [2018-12-09 19:04:16,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:04:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 13931 states and 45200 transitions. [2018-12-09 19:04:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:04:16,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:16,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:16,137 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:16,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1904809647, now seen corresponding path program 1 times [2018-12-09 19:04:16,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:16,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:04:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:16,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:16,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:16,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:04:16,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:16,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:04:16,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:04:16,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:04:16,197 INFO L87 Difference]: Start difference. First operand 13931 states and 45200 transitions. Second operand 7 states. [2018-12-09 19:04:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:16,453 INFO L93 Difference]: Finished difference Result 18509 states and 61120 transitions. [2018-12-09 19:04:16,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:04:16,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 19:04:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:16,474 INFO L225 Difference]: With dead ends: 18509 [2018-12-09 19:04:16,474 INFO L226 Difference]: Without dead ends: 18509 [2018-12-09 19:04:16,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:04:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18509 states. [2018-12-09 19:04:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18509 to 11118. [2018-12-09 19:04:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11118 states. [2018-12-09 19:04:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11118 states to 11118 states and 36254 transitions. [2018-12-09 19:04:16,610 INFO L78 Accepts]: Start accepts. Automaton has 11118 states and 36254 transitions. Word has length 102 [2018-12-09 19:04:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:16,610 INFO L480 AbstractCegarLoop]: Abstraction has 11118 states and 36254 transitions. [2018-12-09 19:04:16,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:04:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 11118 states and 36254 transitions. [2018-12-09 19:04:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:04:16,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:16,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:16,618 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:16,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:16,619 INFO L82 PathProgramCache]: Analyzing trace with hash 989810927, now seen corresponding path program 1 times [2018-12-09 19:04:16,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:16,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:16,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:16,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:16,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:16,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:16,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:04:16,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:16,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:04:16,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:04:16,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:04:16,655 INFO L87 Difference]: Start difference. First operand 11118 states and 36254 transitions. Second operand 5 states. [2018-12-09 19:04:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:16,788 INFO L93 Difference]: Finished difference Result 12910 states and 42014 transitions. [2018-12-09 19:04:16,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:04:16,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 19:04:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:16,803 INFO L225 Difference]: With dead ends: 12910 [2018-12-09 19:04:16,803 INFO L226 Difference]: Without dead ends: 12782 [2018-12-09 19:04:16,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:04:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12782 states. [2018-12-09 19:04:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12782 to 11310. [2018-12-09 19:04:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11310 states. [2018-12-09 19:04:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11310 states to 11310 states and 36814 transitions. [2018-12-09 19:04:16,924 INFO L78 Accepts]: Start accepts. Automaton has 11310 states and 36814 transitions. Word has length 102 [2018-12-09 19:04:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:16,924 INFO L480 AbstractCegarLoop]: Abstraction has 11310 states and 36814 transitions. [2018-12-09 19:04:16,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:04:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 11310 states and 36814 transitions. [2018-12-09 19:04:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:04:16,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:16,933 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:16,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:16,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2060391888, now seen corresponding path program 1 times [2018-12-09 19:04:16,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:16,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:16,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:16,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:16,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:17,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:17,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:04:17,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:17,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:04:17,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:04:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:04:17,024 INFO L87 Difference]: Start difference. First operand 11310 states and 36814 transitions. Second operand 10 states. [2018-12-09 19:04:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:17,332 INFO L93 Difference]: Finished difference Result 21538 states and 70553 transitions. [2018-12-09 19:04:17,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:04:17,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-09 19:04:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:17,344 INFO L225 Difference]: With dead ends: 21538 [2018-12-09 19:04:17,344 INFO L226 Difference]: Without dead ends: 10650 [2018-12-09 19:04:17,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:04:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10650 states. [2018-12-09 19:04:17,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10650 to 10650. [2018-12-09 19:04:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10650 states. [2018-12-09 19:04:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10650 states to 10650 states and 34894 transitions. [2018-12-09 19:04:17,442 INFO L78 Accepts]: Start accepts. Automaton has 10650 states and 34894 transitions. Word has length 102 [2018-12-09 19:04:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:17,442 INFO L480 AbstractCegarLoop]: Abstraction has 10650 states and 34894 transitions. [2018-12-09 19:04:17,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:04:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 10650 states and 34894 transitions. [2018-12-09 19:04:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:04:17,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:17,450 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:17,450 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:17,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:17,450 INFO L82 PathProgramCache]: Analyzing trace with hash 445470452, now seen corresponding path program 2 times [2018-12-09 19:04:17,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:17,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:17,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:17,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:17,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:17,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:17,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:04:17,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:17,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:04:17,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:04:17,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:04:17,520 INFO L87 Difference]: Start difference. First operand 10650 states and 34894 transitions. Second operand 7 states. [2018-12-09 19:04:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:17,718 INFO L93 Difference]: Finished difference Result 17900 states and 59477 transitions. [2018-12-09 19:04:17,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:04:17,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 19:04:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:17,727 INFO L225 Difference]: With dead ends: 17900 [2018-12-09 19:04:17,727 INFO L226 Difference]: Without dead ends: 7461 [2018-12-09 19:04:17,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:04:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2018-12-09 19:04:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7461. [2018-12-09 19:04:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7461 states. [2018-12-09 19:04:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 25135 transitions. [2018-12-09 19:04:17,797 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 25135 transitions. Word has length 102 [2018-12-09 19:04:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:17,797 INFO L480 AbstractCegarLoop]: Abstraction has 7461 states and 25135 transitions. [2018-12-09 19:04:17,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:04:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 25135 transitions. [2018-12-09 19:04:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:04:17,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:17,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:17,803 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:17,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash 791009209, now seen corresponding path program 1 times [2018-12-09 19:04:17,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:17,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:04:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:17,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:17,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:17,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:04:17,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:17,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:04:17,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:04:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:04:17,864 INFO L87 Difference]: Start difference. First operand 7461 states and 25135 transitions. Second operand 6 states. [2018-12-09 19:04:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:17,914 INFO L93 Difference]: Finished difference Result 7805 states and 26005 transitions. [2018-12-09 19:04:17,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:04:17,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 19:04:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:17,923 INFO L225 Difference]: With dead ends: 7805 [2018-12-09 19:04:17,923 INFO L226 Difference]: Without dead ends: 7725 [2018-12-09 19:04:17,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:04:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7725 states. [2018-12-09 19:04:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7725 to 7429. [2018-12-09 19:04:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7429 states. [2018-12-09 19:04:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 25007 transitions. [2018-12-09 19:04:17,993 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 25007 transitions. Word has length 102 [2018-12-09 19:04:17,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:17,993 INFO L480 AbstractCegarLoop]: Abstraction has 7429 states and 25007 transitions. [2018-12-09 19:04:17,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:04:17,993 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 25007 transitions. [2018-12-09 19:04:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:04:17,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:17,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:17,998 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:17,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:17,999 INFO L82 PathProgramCache]: Analyzing trace with hash 342312570, now seen corresponding path program 3 times [2018-12-09 19:04:17,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:17,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:17,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:17,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:18,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:18,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:18,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:04:18,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:04:18,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:04:18,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:04:18,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:04:18,103 INFO L87 Difference]: Start difference. First operand 7429 states and 25007 transitions. Second operand 12 states. [2018-12-09 19:04:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:18,462 INFO L93 Difference]: Finished difference Result 14457 states and 48810 transitions. [2018-12-09 19:04:18,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:04:18,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-09 19:04:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:18,472 INFO L225 Difference]: With dead ends: 14457 [2018-12-09 19:04:18,472 INFO L226 Difference]: Without dead ends: 9913 [2018-12-09 19:04:18,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 19:04:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9913 states. [2018-12-09 19:04:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9913 to 9305. [2018-12-09 19:04:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9305 states. [2018-12-09 19:04:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9305 states to 9305 states and 30650 transitions. [2018-12-09 19:04:18,560 INFO L78 Accepts]: Start accepts. Automaton has 9305 states and 30650 transitions. Word has length 102 [2018-12-09 19:04:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:18,560 INFO L480 AbstractCegarLoop]: Abstraction has 9305 states and 30650 transitions. [2018-12-09 19:04:18,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:04:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 9305 states and 30650 transitions. [2018-12-09 19:04:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:04:18,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:18,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:18,567 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:04:18,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:18,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1540221632, now seen corresponding path program 4 times [2018-12-09 19:04:18,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:04:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:18,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:04:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:04:18,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:04:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:04:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:04:18,623 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:04:18,718 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:04:18,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:04:18 BasicIcfg [2018-12-09 19:04:18,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:04:18,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:04:18,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:04:18,720 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:04:18,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:00:38" (3/4) ... [2018-12-09 19:04:18,722 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:04:18,827 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_747bee74-19e5-4f2d-a675-c06d8f01523f/bin-2019/utaipan/witness.graphml [2018-12-09 19:04:18,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:04:18,828 INFO L168 Benchmark]: Toolchain (without parser) took 220794.26 ms. Allocated memory was 1.0 GB in the beginning and 9.7 GB in the end (delta: 8.7 GB). Free memory was 947.0 MB in the beginning and 8.9 GB in the end (delta: -8.0 GB). Peak memory consumption was 716.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:04:18,829 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:04:18,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:04:18,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:04:18,830 INFO L168 Benchmark]: Boogie Preprocessor took 19.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:04:18,830 INFO L168 Benchmark]: RCFGBuilder took 326.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:04:18,830 INFO L168 Benchmark]: TraceAbstraction took 219959.38 ms. Allocated memory was 1.1 GB in the beginning and 9.7 GB in the end (delta: 8.6 GB). Free memory was 1.0 GB in the beginning and 9.0 GB in the end (delta: -7.9 GB). Peak memory consumption was 664.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:04:18,830 INFO L168 Benchmark]: Witness Printer took 107.10 ms. Allocated memory is still 9.7 GB. Free memory was 9.0 GB in the beginning and 8.9 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:04:18,832 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 326.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 219959.38 ms. Allocated memory was 1.1 GB in the beginning and 9.7 GB in the end (delta: 8.6 GB). Free memory was 1.0 GB in the beginning and 9.0 GB in the end (delta: -7.9 GB). Peak memory consumption was 664.4 MB. Max. memory is 11.5 GB. * Witness Printer took 107.10 ms. Allocated memory is still 9.7 GB. Free memory was 9.0 GB in the beginning and 8.9 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t1494, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1495; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1495, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1496; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1496, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 y$w_buff1 = y$w_buff0 [L740] 0 y$w_buff0 = 2 [L741] 0 y$w_buff1_used = y$w_buff0_used [L742] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 0 y$r_buff0_thd3 = (_Bool)1 [L751] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] 1 z = 1 [L707] 1 x = 1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 2 x = 2 [L722] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L728] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L732] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L795] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L796] -1 y$flush_delayed = weak$$choice2 [L797] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L804] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y = y$flush_delayed ? y$mem_tmp : y [L807] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 219.8s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 73.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9297 SDtfs, 10565 SDslu, 22409 SDs, 0 SdLazy, 7966 SolverSat, 545 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 109 SyntacticMatches, 17 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542807occurred in iteration=12, 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: 126.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 1455318 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3175 NumberOfCodeBlocks, 3175 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3037 ConstructedInterpolants, 0 QuantifiedInterpolants, 630070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...