./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.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_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/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 9a0d08bfd8098766a5ad0a6222addfa7401e63dc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:27:20,664 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:27:20,665 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:27:20,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:27:20,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:27:20,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:27:20,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:27:20,673 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:27:20,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:27:20,674 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:27:20,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:27:20,674 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:27:20,675 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:27:20,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:27:20,676 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:27:20,676 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:27:20,677 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:27:20,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:27:20,678 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:27:20,679 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:27:20,680 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:27:20,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:27:20,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:27:20,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:27:20,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:27:20,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:27:20,682 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:27:20,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:27:20,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:27:20,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:27:20,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:27:20,684 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:27:20,684 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:27:20,684 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:27:20,685 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:27:20,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:27:20,685 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 17:27:20,692 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:27:20,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:27:20,693 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:27:20,693 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:27:20,693 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:27:20,693 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:27:20,693 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:27:20,694 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 17:27:20,694 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:27:20,694 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:27:20,694 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 17:27:20,694 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 17:27:20,694 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:27:20,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:27:20,695 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:27:20,695 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:27:20,695 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:27:20,695 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:27:20,695 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:27:20,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:27:20,695 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:27:20,696 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:27:20,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:27:20,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:27:20,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:27:20,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:27:20,696 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:27:20,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:27:20,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:27:20,696 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:27:20,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:27:20,697 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:27:20,697 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 17:27:20,697 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:27:20,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:27:20,697 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 17:27:20,697 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_70dd735e-1384-4b60-91e6-6a4e840ea10f/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 -> 9a0d08bfd8098766a5ad0a6222addfa7401e63dc [2018-12-08 17:27:20,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:27:20,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:27:20,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:27:20,724 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:27:20,724 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:27:20,724 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix012_rmo.opt_false-unreach-call.i [2018-12-08 17:27:20,758 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/data/f9d85ca05/d6e6ad36d9e54fffadbc0511676d2e65/FLAG330e47911 [2018-12-08 17:27:21,192 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:27:21,193 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/sv-benchmarks/c/pthread-wmm/mix012_rmo.opt_false-unreach-call.i [2018-12-08 17:27:21,201 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/data/f9d85ca05/d6e6ad36d9e54fffadbc0511676d2e65/FLAG330e47911 [2018-12-08 17:27:21,209 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/data/f9d85ca05/d6e6ad36d9e54fffadbc0511676d2e65 [2018-12-08 17:27:21,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:27:21,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:27:21,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:27:21,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:27:21,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:27:21,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:27:21" (1/1) ... [2018-12-08 17:27:21,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdc5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21, skipping insertion in model container [2018-12-08 17:27:21,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:27:21" (1/1) ... [2018-12-08 17:27:21,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:27:21,241 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:27:21,427 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:27:21,437 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:27:21,516 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:27:21,544 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:27:21,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21 WrapperNode [2018-12-08 17:27:21,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:27:21,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:27:21,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:27:21,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:27:21,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21" (1/1) ... [2018-12-08 17:27:21,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21" (1/1) ... [2018-12-08 17:27:21,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:27:21,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:27:21,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:27:21,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:27:21,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21" (1/1) ... [2018-12-08 17:27:21,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21" (1/1) ... [2018-12-08 17:27:21,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21" (1/1) ... [2018-12-08 17:27:21,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21" (1/1) ... [2018-12-08 17:27:21,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21" (1/1) ... [2018-12-08 17:27:21,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21" (1/1) ... [2018-12-08 17:27:21,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21" (1/1) ... [2018-12-08 17:27:21,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:27:21,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:27:21,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:27:21,596 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:27:21,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:27:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:27:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:27:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 17:27:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:27:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 17:27:21,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 17:27:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 17:27:21,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 17:27:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 17:27:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:27:21,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:27:21,630 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 17:27:21,942 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:27:21,942 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 17:27:21,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:27:21 BoogieIcfgContainer [2018-12-08 17:27:21,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:27:21,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:27:21,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:27:21,946 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:27:21,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:27:21" (1/3) ... [2018-12-08 17:27:21,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ca8d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:27:21, skipping insertion in model container [2018-12-08 17:27:21,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:27:21" (2/3) ... [2018-12-08 17:27:21,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ca8d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:27:21, skipping insertion in model container [2018-12-08 17:27:21,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:27:21" (3/3) ... [2018-12-08 17:27:21,948 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_rmo.opt_false-unreach-call.i [2018-12-08 17:27:21,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,975 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,975 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,975 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,975 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,975 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,979 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:21,994 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:27:22,000 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 17:27:22,000 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:27:22,006 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 17:27:22,018 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 17:27:22,035 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:27:22,035 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:27:22,035 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:27:22,035 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:27:22,035 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:27:22,035 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:27:22,035 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:27:22,035 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:27:22,042 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-08 17:27:23,668 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-08 17:27:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-08 17:27:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 17:27:23,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:23,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:23,676 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:23,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:23,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-08 17:27:23,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:23,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:23,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:23,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:23,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:23,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:27:23,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:23,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:27:23,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:27:23,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:27:23,829 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-08 17:27:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:24,288 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-08 17:27:24,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:27:24,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-08 17:27:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:24,432 INFO L225 Difference]: With dead ends: 60791 [2018-12-08 17:27:24,432 INFO L226 Difference]: Without dead ends: 44271 [2018-12-08 17:27:24,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:27:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-08 17:27:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-08 17:27:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-08 17:27:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-08 17:27:25,187 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-08 17:27:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:25,187 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-08 17:27:25,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:27:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-08 17:27:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 17:27:25,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:25,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:25,192 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:25,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-08 17:27:25,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:25,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:25,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:25,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:27:25,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:25,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:27:25,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:27:25,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:27:25,258 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-08 17:27:25,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:25,825 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-08 17:27:25,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:27:25,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-08 17:27:25,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:26,068 INFO L225 Difference]: With dead ends: 64005 [2018-12-08 17:27:26,068 INFO L226 Difference]: Without dead ends: 63453 [2018-12-08 17:27:26,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:27:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-08 17:27:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-08 17:27:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-08 17:27:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-08 17:27:26,786 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-08 17:27:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:26,787 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-08 17:27:26,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:27:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-08 17:27:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 17:27:26,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:26,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:26,791 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:26,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:26,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-08 17:27:26,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:26,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:26,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:26,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:26,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:26,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:26,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:27:26,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:26,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:27:26,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:27:26,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:27:26,836 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-08 17:27:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:27,403 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-08 17:27:27,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:27:27,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-08 17:27:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:27,554 INFO L225 Difference]: With dead ends: 81367 [2018-12-08 17:27:27,554 INFO L226 Difference]: Without dead ends: 80855 [2018-12-08 17:27:27,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:27:27,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-08 17:27:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-08 17:27:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-08 17:27:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-08 17:27:28,537 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-08 17:27:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:28,537 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-08 17:27:28,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:27:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-08 17:27:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 17:27:28,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:28,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:28,542 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:28,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:28,542 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-08 17:27:28,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:28,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:28,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:28,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:28,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:28,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:28,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:27:28,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:28,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:27:28,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:27:28,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:27:28,566 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-08 17:27:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:28,780 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-08 17:27:28,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:27:28,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-08 17:27:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:28,890 INFO L225 Difference]: With dead ends: 65251 [2018-12-08 17:27:28,891 INFO L226 Difference]: Without dead ends: 65251 [2018-12-08 17:27:28,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:27:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-08 17:27:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-08 17:27:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-08 17:27:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-08 17:27:29,896 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-08 17:27:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:29,896 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-08 17:27:29,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:27:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-08 17:27:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 17:27:29,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:29,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:29,904 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:29,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:29,904 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-08 17:27:29,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:29,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:29,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:29,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:29,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:30,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:27:30,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:30,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:27:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:27:30,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:27:30,002 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-08 17:27:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:30,526 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-08 17:27:30,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:27:30,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-08 17:27:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:30,666 INFO L225 Difference]: With dead ends: 67511 [2018-12-08 17:27:30,666 INFO L226 Difference]: Without dead ends: 67511 [2018-12-08 17:27:30,666 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-08 17:27:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-08 17:27:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-08 17:27:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-08 17:27:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-08 17:27:31,713 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-08 17:27:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:31,713 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-08 17:27:31,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:27:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-08 17:27:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 17:27:31,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:31,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:31,722 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:31,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:31,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-08 17:27:31,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:31,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:31,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:31,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:31,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:31,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:31,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:27:31,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:31,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:27:31,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:27:31,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:27:31,786 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-08 17:27:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:32,600 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-08 17:27:32,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:27:32,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-08 17:27:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:32,746 INFO L225 Difference]: With dead ends: 88528 [2018-12-08 17:27:32,746 INFO L226 Difference]: Without dead ends: 88528 [2018-12-08 17:27:32,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:27:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-08 17:27:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-08 17:27:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-08 17:27:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-08 17:27:34,113 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-08 17:27:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:34,114 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-08 17:27:34,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:27:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-08 17:27:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 17:27:34,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:34,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:34,123 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:34,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:34,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-08 17:27:34,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:34,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:34,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:34,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:34,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:34,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:34,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:27:34,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:34,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:27:34,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:27:34,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:27:34,154 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-08 17:27:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:34,330 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-08 17:27:34,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:27:34,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-08 17:27:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:34,430 INFO L225 Difference]: With dead ends: 57182 [2018-12-08 17:27:34,430 INFO L226 Difference]: Without dead ends: 57182 [2018-12-08 17:27:34,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:27:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-08 17:27:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-08 17:27:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-08 17:27:35,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-08 17:27:35,297 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-08 17:27:35,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:35,297 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-08 17:27:35,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:27:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-08 17:27:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 17:27:35,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:35,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:35,304 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:35,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:35,304 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-08 17:27:35,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:35,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:35,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:35,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:35,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:35,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:35,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:27:35,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:35,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:27:35,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:27:35,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:27:35,361 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-08 17:27:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:35,888 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-08 17:27:35,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:27:35,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-08 17:27:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:36,185 INFO L225 Difference]: With dead ends: 97908 [2018-12-08 17:27:36,186 INFO L226 Difference]: Without dead ends: 97332 [2018-12-08 17:27:36,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:27:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-08 17:27:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-08 17:27:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-08 17:27:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-08 17:27:37,198 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-08 17:27:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:37,199 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-08 17:27:37,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:27:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-08 17:27:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 17:27:37,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:37,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:37,206 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:37,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:37,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-08 17:27:37,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:37,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:37,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:37,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:37,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:27:37,232 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:37,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:27:37,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:27:37,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:27:37,233 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 4 states. [2018-12-08 17:27:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:37,286 INFO L93 Difference]: Finished difference Result 12705 states and 39586 transitions. [2018-12-08 17:27:37,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:27:37,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-08 17:27:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:37,297 INFO L225 Difference]: With dead ends: 12705 [2018-12-08 17:27:37,297 INFO L226 Difference]: Without dead ends: 10887 [2018-12-08 17:27:37,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:27:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-08 17:27:37,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-08 17:27:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-08 17:27:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33402 transitions. [2018-12-08 17:27:37,402 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33402 transitions. Word has length 54 [2018-12-08 17:27:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:37,402 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33402 transitions. [2018-12-08 17:27:37,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:27:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33402 transitions. [2018-12-08 17:27:37,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 17:27:37,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:37,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:37,404 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:37,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:37,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-08 17:27:37,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:37,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:37,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:37,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:37,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:27:37,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:37,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:27:37,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:27:37,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:27:37,434 INFO L87 Difference]: Start difference. First operand 10839 states and 33402 transitions. Second operand 4 states. [2018-12-08 17:27:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:37,505 INFO L93 Difference]: Finished difference Result 12386 states and 38231 transitions. [2018-12-08 17:27:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:27:37,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-08 17:27:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:37,518 INFO L225 Difference]: With dead ends: 12386 [2018-12-08 17:27:37,518 INFO L226 Difference]: Without dead ends: 12386 [2018-12-08 17:27:37,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:27:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-08 17:27:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-08 17:27:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-08 17:27:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 35015 transitions. [2018-12-08 17:27:37,632 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 35015 transitions. Word has length 61 [2018-12-08 17:27:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:37,633 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 35015 transitions. [2018-12-08 17:27:37,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:27:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 35015 transitions. [2018-12-08 17:27:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 17:27:37,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:37,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:37,635 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:37,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-08 17:27:37,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:37,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:37,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:37,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:37,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:37,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:37,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:27:37,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:37,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:27:37,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:27:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:27:37,683 INFO L87 Difference]: Start difference. First operand 11359 states and 35015 transitions. Second operand 6 states. [2018-12-08 17:27:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:37,941 INFO L93 Difference]: Finished difference Result 20935 states and 64448 transitions. [2018-12-08 17:27:37,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:27:37,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-08 17:27:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:37,962 INFO L225 Difference]: With dead ends: 20935 [2018-12-08 17:27:37,962 INFO L226 Difference]: Without dead ends: 20864 [2018-12-08 17:27:37,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:27:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-08 17:27:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-08 17:27:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-08 17:27:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40712 transitions. [2018-12-08 17:27:38,138 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40712 transitions. Word has length 61 [2018-12-08 17:27:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:38,138 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40712 transitions. [2018-12-08 17:27:38,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:27:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40712 transitions. [2018-12-08 17:27:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 17:27:38,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:38,142 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-08 17:27:38,142 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:38,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2018-12-08 17:27:38,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:38,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:38,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:38,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:38,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:38,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:38,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:27:38,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:38,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:27:38,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:27:38,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:27:38,163 INFO L87 Difference]: Start difference. First operand 13298 states and 40712 transitions. Second operand 3 states. [2018-12-08 17:27:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:38,293 INFO L93 Difference]: Finished difference Result 13930 states and 42364 transitions. [2018-12-08 17:27:38,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:27:38,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-08 17:27:38,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:38,307 INFO L225 Difference]: With dead ends: 13930 [2018-12-08 17:27:38,307 INFO L226 Difference]: Without dead ends: 13930 [2018-12-08 17:27:38,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:27:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-08 17:27:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-08 17:27:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-08 17:27:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41538 transitions. [2018-12-08 17:27:38,443 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41538 transitions. Word has length 67 [2018-12-08 17:27:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:38,443 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41538 transitions. [2018-12-08 17:27:38,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:27:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41538 transitions. [2018-12-08 17:27:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 17:27:38,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:38,447 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-08 17:27:38,447 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:38,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:38,448 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2018-12-08 17:27:38,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:38,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:38,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:38,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:38,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:38,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:38,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:27:38,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:38,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:27:38,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:27:38,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:27:38,476 INFO L87 Difference]: Start difference. First operand 13614 states and 41538 transitions. Second operand 4 states. [2018-12-08 17:27:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:38,646 INFO L93 Difference]: Finished difference Result 17463 states and 52743 transitions. [2018-12-08 17:27:38,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:27:38,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-08 17:27:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:38,663 INFO L225 Difference]: With dead ends: 17463 [2018-12-08 17:27:38,663 INFO L226 Difference]: Without dead ends: 17463 [2018-12-08 17:27:38,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:27:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-08 17:27:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-08 17:27:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-08 17:27:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46198 transitions. [2018-12-08 17:27:38,813 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46198 transitions. Word has length 67 [2018-12-08 17:27:38,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:38,813 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46198 transitions. [2018-12-08 17:27:38,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:27:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46198 transitions. [2018-12-08 17:27:38,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 17:27:38,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:38,819 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-08 17:27:38,819 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:38,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:38,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2018-12-08 17:27:38,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:38,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:38,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:38,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:38,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:38,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:38,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:27:38,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:38,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:27:38,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:27:38,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:27:38,879 INFO L87 Difference]: Start difference. First operand 15244 states and 46198 transitions. Second operand 6 states. [2018-12-08 17:27:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:39,336 INFO L93 Difference]: Finished difference Result 18862 states and 56126 transitions. [2018-12-08 17:27:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:27:39,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-08 17:27:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:39,354 INFO L225 Difference]: With dead ends: 18862 [2018-12-08 17:27:39,354 INFO L226 Difference]: Without dead ends: 18862 [2018-12-08 17:27:39,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:27:39,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-08 17:27:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-08 17:27:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-08 17:27:39,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53178 transitions. [2018-12-08 17:27:39,543 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53178 transitions. Word has length 67 [2018-12-08 17:27:39,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:39,543 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53178 transitions. [2018-12-08 17:27:39,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:27:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53178 transitions. [2018-12-08 17:27:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 17:27:39,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:39,549 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-08 17:27:39,549 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:39,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2018-12-08 17:27:39,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:39,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:39,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:39,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:39,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:39,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:39,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:27:39,611 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:39,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:27:39,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:27:39,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:27:39,611 INFO L87 Difference]: Start difference. First operand 17720 states and 53178 transitions. Second operand 6 states. [2018-12-08 17:27:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:39,859 INFO L93 Difference]: Finished difference Result 20389 states and 59240 transitions. [2018-12-08 17:27:39,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:27:39,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-08 17:27:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:39,878 INFO L225 Difference]: With dead ends: 20389 [2018-12-08 17:27:39,879 INFO L226 Difference]: Without dead ends: 20389 [2018-12-08 17:27:39,879 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-08 17:27:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-08 17:27:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-08 17:27:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-08 17:27:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53189 transitions. [2018-12-08 17:27:40,066 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53189 transitions. Word has length 67 [2018-12-08 17:27:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:40,066 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53189 transitions. [2018-12-08 17:27:40,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:27:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53189 transitions. [2018-12-08 17:27:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 17:27:40,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:40,074 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-08 17:27:40,074 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:40,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2018-12-08 17:27:40,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:40,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:40,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:40,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:40,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:40,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:40,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:27:40,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:40,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:27:40,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:27:40,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:27:40,115 INFO L87 Difference]: Start difference. First operand 18002 states and 53189 transitions. Second operand 5 states. [2018-12-08 17:27:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:40,344 INFO L93 Difference]: Finished difference Result 23413 states and 68682 transitions. [2018-12-08 17:27:40,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:27:40,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-08 17:27:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:40,366 INFO L225 Difference]: With dead ends: 23413 [2018-12-08 17:27:40,366 INFO L226 Difference]: Without dead ends: 23413 [2018-12-08 17:27:40,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:27:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-08 17:27:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-08 17:27:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-08 17:27:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62593 transitions. [2018-12-08 17:27:40,591 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62593 transitions. Word has length 67 [2018-12-08 17:27:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:40,592 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62593 transitions. [2018-12-08 17:27:40,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:27:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62593 transitions. [2018-12-08 17:27:40,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 17:27:40,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:40,599 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-08 17:27:40,599 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:40,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-08 17:27:40,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:40,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:40,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:40,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:40,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:40,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:40,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:27:40,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:40,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:27:40,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:27:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:27:40,652 INFO L87 Difference]: Start difference. First operand 21350 states and 62593 transitions. Second operand 4 states. [2018-12-08 17:27:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:40,964 INFO L93 Difference]: Finished difference Result 26758 states and 78553 transitions. [2018-12-08 17:27:40,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:27:40,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-08 17:27:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:40,991 INFO L225 Difference]: With dead ends: 26758 [2018-12-08 17:27:40,992 INFO L226 Difference]: Without dead ends: 26462 [2018-12-08 17:27:40,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:27:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26462 states. [2018-12-08 17:27:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26462 to 25142. [2018-12-08 17:27:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25142 states. [2018-12-08 17:27:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25142 states to 25142 states and 73709 transitions. [2018-12-08 17:27:41,261 INFO L78 Accepts]: Start accepts. Automaton has 25142 states and 73709 transitions. Word has length 67 [2018-12-08 17:27:41,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:41,261 INFO L480 AbstractCegarLoop]: Abstraction has 25142 states and 73709 transitions. [2018-12-08 17:27:41,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:27:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 25142 states and 73709 transitions. [2018-12-08 17:27:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 17:27:41,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:41,268 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-08 17:27:41,268 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:41,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:41,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-08 17:27:41,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:41,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:41,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:41,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:41,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:41,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:41,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:27:41,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:41,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:27:41,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:27:41,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:27:41,302 INFO L87 Difference]: Start difference. First operand 25142 states and 73709 transitions. Second operand 5 states. [2018-12-08 17:27:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:41,328 INFO L93 Difference]: Finished difference Result 7314 states and 17674 transitions. [2018-12-08 17:27:41,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:27:41,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-08 17:27:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:41,333 INFO L225 Difference]: With dead ends: 7314 [2018-12-08 17:27:41,333 INFO L226 Difference]: Without dead ends: 6004 [2018-12-08 17:27:41,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:27:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2018-12-08 17:27:41,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5514. [2018-12-08 17:27:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5514 states. [2018-12-08 17:27:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 12848 transitions. [2018-12-08 17:27:41,371 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 12848 transitions. Word has length 67 [2018-12-08 17:27:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:41,371 INFO L480 AbstractCegarLoop]: Abstraction has 5514 states and 12848 transitions. [2018-12-08 17:27:41,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:27:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 12848 transitions. [2018-12-08 17:27:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 17:27:41,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:41,375 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-08 17:27:41,375 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:41,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:41,375 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-08 17:27:41,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:41,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:41,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:41,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:41,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:27:41,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:41,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:27:41,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:27:41,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:27:41,390 INFO L87 Difference]: Start difference. First operand 5514 states and 12848 transitions. Second operand 3 states. [2018-12-08 17:27:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:41,410 INFO L93 Difference]: Finished difference Result 7126 states and 16417 transitions. [2018-12-08 17:27:41,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:27:41,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-08 17:27:41,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:41,415 INFO L225 Difference]: With dead ends: 7126 [2018-12-08 17:27:41,415 INFO L226 Difference]: Without dead ends: 7126 [2018-12-08 17:27:41,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:27:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2018-12-08 17:27:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 5453. [2018-12-08 17:27:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2018-12-08 17:27:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 12388 transitions. [2018-12-08 17:27:41,456 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 12388 transitions. Word has length 67 [2018-12-08 17:27:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:41,456 INFO L480 AbstractCegarLoop]: Abstraction has 5453 states and 12388 transitions. [2018-12-08 17:27:41,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:27:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 12388 transitions. [2018-12-08 17:27:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 17:27:41,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:41,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:41,460 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:41,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:41,460 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-08 17:27:41,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:41,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:41,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:41,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:41,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:41,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:41,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:27:41,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:41,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:27:41,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:27:41,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:27:41,504 INFO L87 Difference]: Start difference. First operand 5453 states and 12388 transitions. Second operand 5 states. [2018-12-08 17:27:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:41,602 INFO L93 Difference]: Finished difference Result 6617 states and 15012 transitions. [2018-12-08 17:27:41,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:27:41,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-08 17:27:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:41,607 INFO L225 Difference]: With dead ends: 6617 [2018-12-08 17:27:41,607 INFO L226 Difference]: Without dead ends: 6617 [2018-12-08 17:27:41,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:27:41,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-12-08 17:27:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 5897. [2018-12-08 17:27:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2018-12-08 17:27:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 13392 transitions. [2018-12-08 17:27:41,648 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 13392 transitions. Word has length 73 [2018-12-08 17:27:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:41,649 INFO L480 AbstractCegarLoop]: Abstraction has 5897 states and 13392 transitions. [2018-12-08 17:27:41,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:27:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 13392 transitions. [2018-12-08 17:27:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 17:27:41,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:41,653 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:41,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:41,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-08 17:27:41,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:41,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:41,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:41,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:41,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:41,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:41,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:27:41,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:41,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:27:41,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:27:41,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:27:41,696 INFO L87 Difference]: Start difference. First operand 5897 states and 13392 transitions. Second operand 7 states. [2018-12-08 17:27:41,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:41,907 INFO L93 Difference]: Finished difference Result 7099 states and 15961 transitions. [2018-12-08 17:27:41,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:27:41,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-08 17:27:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:41,911 INFO L225 Difference]: With dead ends: 7099 [2018-12-08 17:27:41,911 INFO L226 Difference]: Without dead ends: 6980 [2018-12-08 17:27:41,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:27:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2018-12-08 17:27:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 5994. [2018-12-08 17:27:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2018-12-08 17:27:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 13485 transitions. [2018-12-08 17:27:41,953 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 13485 transitions. Word has length 73 [2018-12-08 17:27:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:41,953 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 13485 transitions. [2018-12-08 17:27:41,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:27:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 13485 transitions. [2018-12-08 17:27:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 17:27:41,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:41,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:41,957 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:41,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1678014975, now seen corresponding path program 1 times [2018-12-08 17:27:41,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:41,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:41,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:41,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:41,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:27:41,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:41,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:27:41,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:27:41,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:27:41,997 INFO L87 Difference]: Start difference. First operand 5994 states and 13485 transitions. Second operand 5 states. [2018-12-08 17:27:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:42,204 INFO L93 Difference]: Finished difference Result 5550 states and 12354 transitions. [2018-12-08 17:27:42,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:27:42,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-08 17:27:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:42,208 INFO L225 Difference]: With dead ends: 5550 [2018-12-08 17:27:42,208 INFO L226 Difference]: Without dead ends: 5550 [2018-12-08 17:27:42,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:27:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2018-12-08 17:27:42,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 5153. [2018-12-08 17:27:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2018-12-08 17:27:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 11452 transitions. [2018-12-08 17:27:42,246 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 11452 transitions. Word has length 94 [2018-12-08 17:27:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:42,247 INFO L480 AbstractCegarLoop]: Abstraction has 5153 states and 11452 transitions. [2018-12-08 17:27:42,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:27:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 11452 transitions. [2018-12-08 17:27:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 17:27:42,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:42,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:42,250 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:42,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:42,250 INFO L82 PathProgramCache]: Analyzing trace with hash -451364121, now seen corresponding path program 1 times [2018-12-08 17:27:42,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:42,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:42,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:42,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:42,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:42,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:42,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:27:42,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:42,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:27:42,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:27:42,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:27:42,302 INFO L87 Difference]: Start difference. First operand 5153 states and 11452 transitions. Second operand 4 states. [2018-12-08 17:27:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:42,415 INFO L93 Difference]: Finished difference Result 6337 states and 14007 transitions. [2018-12-08 17:27:42,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:27:42,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-08 17:27:42,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:42,419 INFO L225 Difference]: With dead ends: 6337 [2018-12-08 17:27:42,419 INFO L226 Difference]: Without dead ends: 6337 [2018-12-08 17:27:42,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:27:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2018-12-08 17:27:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 5568. [2018-12-08 17:27:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5568 states. [2018-12-08 17:27:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5568 states to 5568 states and 12373 transitions. [2018-12-08 17:27:42,459 INFO L78 Accepts]: Start accepts. Automaton has 5568 states and 12373 transitions. Word has length 94 [2018-12-08 17:27:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:42,459 INFO L480 AbstractCegarLoop]: Abstraction has 5568 states and 12373 transitions. [2018-12-08 17:27:42,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:27:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5568 states and 12373 transitions. [2018-12-08 17:27:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 17:27:42,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:42,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:42,465 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:42,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:42,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1661573399, now seen corresponding path program 1 times [2018-12-08 17:27:42,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:42,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:42,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:42,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:42,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:42,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:42,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:27:42,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:42,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:27:42,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:27:42,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:27:42,521 INFO L87 Difference]: Start difference. First operand 5568 states and 12373 transitions. Second operand 5 states. [2018-12-08 17:27:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:42,590 INFO L93 Difference]: Finished difference Result 6441 states and 14301 transitions. [2018-12-08 17:27:42,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:27:42,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-08 17:27:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:42,594 INFO L225 Difference]: With dead ends: 6441 [2018-12-08 17:27:42,594 INFO L226 Difference]: Without dead ends: 6441 [2018-12-08 17:27:42,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:27:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2018-12-08 17:27:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5079. [2018-12-08 17:27:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5079 states. [2018-12-08 17:27:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 11282 transitions. [2018-12-08 17:27:42,631 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 11282 transitions. Word has length 96 [2018-12-08 17:27:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:42,631 INFO L480 AbstractCegarLoop]: Abstraction has 5079 states and 11282 transitions. [2018-12-08 17:27:42,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:27:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 11282 transitions. [2018-12-08 17:27:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 17:27:42,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:42,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:42,634 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:42,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:42,635 INFO L82 PathProgramCache]: Analyzing trace with hash -28769400, now seen corresponding path program 1 times [2018-12-08 17:27:42,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:42,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:42,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:42,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:42,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:42,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:27:42,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:42,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:27:42,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:27:42,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:27:42,723 INFO L87 Difference]: Start difference. First operand 5079 states and 11282 transitions. Second operand 7 states. [2018-12-08 17:27:42,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:42,928 INFO L93 Difference]: Finished difference Result 6777 states and 14905 transitions. [2018-12-08 17:27:42,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:27:42,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-08 17:27:42,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:42,933 INFO L225 Difference]: With dead ends: 6777 [2018-12-08 17:27:42,933 INFO L226 Difference]: Without dead ends: 6723 [2018-12-08 17:27:42,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:27:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6723 states. [2018-12-08 17:27:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6723 to 5556. [2018-12-08 17:27:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5556 states. [2018-12-08 17:27:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 12272 transitions. [2018-12-08 17:27:42,972 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 12272 transitions. Word has length 96 [2018-12-08 17:27:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:42,972 INFO L480 AbstractCegarLoop]: Abstraction has 5556 states and 12272 transitions. [2018-12-08 17:27:42,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:27:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 12272 transitions. [2018-12-08 17:27:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 17:27:42,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:42,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:42,977 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:42,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:42,977 INFO L82 PathProgramCache]: Analyzing trace with hash -543358231, now seen corresponding path program 1 times [2018-12-08 17:27:42,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:42,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:42,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:43,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:43,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:27:43,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:43,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:27:43,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:27:43,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:27:43,018 INFO L87 Difference]: Start difference. First operand 5556 states and 12272 transitions. Second operand 6 states. [2018-12-08 17:27:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:43,217 INFO L93 Difference]: Finished difference Result 6493 states and 14426 transitions. [2018-12-08 17:27:43,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:27:43,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-08 17:27:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:43,223 INFO L225 Difference]: With dead ends: 6493 [2018-12-08 17:27:43,223 INFO L226 Difference]: Without dead ends: 6493 [2018-12-08 17:27:43,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:27:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6493 states. [2018-12-08 17:27:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6493 to 5763. [2018-12-08 17:27:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5763 states. [2018-12-08 17:27:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 12725 transitions. [2018-12-08 17:27:43,272 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 12725 transitions. Word has length 96 [2018-12-08 17:27:43,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:43,272 INFO L480 AbstractCegarLoop]: Abstraction has 5763 states and 12725 transitions. [2018-12-08 17:27:43,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:27:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 12725 transitions. [2018-12-08 17:27:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 17:27:43,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:43,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:43,276 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:43,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash 400392135, now seen corresponding path program 1 times [2018-12-08 17:27:43,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:43,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:43,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:43,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:43,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:43,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:43,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:27:43,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:43,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:27:43,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:27:43,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:27:43,321 INFO L87 Difference]: Start difference. First operand 5763 states and 12725 transitions. Second operand 6 states. [2018-12-08 17:27:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:43,654 INFO L93 Difference]: Finished difference Result 7787 states and 17066 transitions. [2018-12-08 17:27:43,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:27:43,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-08 17:27:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:43,659 INFO L225 Difference]: With dead ends: 7787 [2018-12-08 17:27:43,659 INFO L226 Difference]: Without dead ends: 7771 [2018-12-08 17:27:43,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:27:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2018-12-08 17:27:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 6210. [2018-12-08 17:27:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2018-12-08 17:27:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 13818 transitions. [2018-12-08 17:27:43,707 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 13818 transitions. Word has length 96 [2018-12-08 17:27:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:43,708 INFO L480 AbstractCegarLoop]: Abstraction has 6210 states and 13818 transitions. [2018-12-08 17:27:43,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:27:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 13818 transitions. [2018-12-08 17:27:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 17:27:43,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:43,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:43,712 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:43,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:43,712 INFO L82 PathProgramCache]: Analyzing trace with hash 611743048, now seen corresponding path program 1 times [2018-12-08 17:27:43,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:43,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:43,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:43,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:43,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:43,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:43,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:27:43,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:43,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:27:43,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:27:43,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:27:43,785 INFO L87 Difference]: Start difference. First operand 6210 states and 13818 transitions. Second operand 6 states. [2018-12-08 17:27:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:43,892 INFO L93 Difference]: Finished difference Result 6536 states and 14293 transitions. [2018-12-08 17:27:43,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:27:43,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-08 17:27:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:43,896 INFO L225 Difference]: With dead ends: 6536 [2018-12-08 17:27:43,896 INFO L226 Difference]: Without dead ends: 6514 [2018-12-08 17:27:43,896 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-08 17:27:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2018-12-08 17:27:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 5548. [2018-12-08 17:27:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5548 states. [2018-12-08 17:27:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5548 states to 5548 states and 12250 transitions. [2018-12-08 17:27:43,938 INFO L78 Accepts]: Start accepts. Automaton has 5548 states and 12250 transitions. Word has length 96 [2018-12-08 17:27:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:43,938 INFO L480 AbstractCegarLoop]: Abstraction has 5548 states and 12250 transitions. [2018-12-08 17:27:43,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:27:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5548 states and 12250 transitions. [2018-12-08 17:27:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 17:27:43,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:43,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:43,942 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:43,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:43,943 INFO L82 PathProgramCache]: Analyzing trace with hash -893987928, now seen corresponding path program 1 times [2018-12-08 17:27:43,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:43,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:43,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:44,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:44,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 17:27:44,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:44,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:27:44,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:27:44,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:27:44,082 INFO L87 Difference]: Start difference. First operand 5548 states and 12250 transitions. Second operand 9 states. [2018-12-08 17:27:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:44,386 INFO L93 Difference]: Finished difference Result 6597 states and 14375 transitions. [2018-12-08 17:27:44,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:27:44,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-08 17:27:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:44,390 INFO L225 Difference]: With dead ends: 6597 [2018-12-08 17:27:44,390 INFO L226 Difference]: Without dead ends: 6597 [2018-12-08 17:27:44,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:27:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2018-12-08 17:27:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 5852. [2018-12-08 17:27:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5852 states. [2018-12-08 17:27:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 12874 transitions. [2018-12-08 17:27:44,430 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 12874 transitions. Word has length 96 [2018-12-08 17:27:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:44,430 INFO L480 AbstractCegarLoop]: Abstraction has 5852 states and 12874 transitions. [2018-12-08 17:27:44,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:27:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 12874 transitions. [2018-12-08 17:27:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 17:27:44,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:44,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:44,434 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:44,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:44,434 INFO L82 PathProgramCache]: Analyzing trace with hash 273485737, now seen corresponding path program 1 times [2018-12-08 17:27:44,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:44,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:44,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:44,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:44,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:27:44,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:44,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:27:44,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:27:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:27:44,487 INFO L87 Difference]: Start difference. First operand 5852 states and 12874 transitions. Second operand 7 states. [2018-12-08 17:27:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:44,685 INFO L93 Difference]: Finished difference Result 7331 states and 16051 transitions. [2018-12-08 17:27:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:27:44,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-08 17:27:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:44,689 INFO L225 Difference]: With dead ends: 7331 [2018-12-08 17:27:44,689 INFO L226 Difference]: Without dead ends: 7331 [2018-12-08 17:27:44,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-08 17:27:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2018-12-08 17:27:44,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 6796. [2018-12-08 17:27:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6796 states. [2018-12-08 17:27:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6796 states to 6796 states and 14856 transitions. [2018-12-08 17:27:44,738 INFO L78 Accepts]: Start accepts. Automaton has 6796 states and 14856 transitions. Word has length 96 [2018-12-08 17:27:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:44,738 INFO L480 AbstractCegarLoop]: Abstraction has 6796 states and 14856 transitions. [2018-12-08 17:27:44,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:27:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6796 states and 14856 transitions. [2018-12-08 17:27:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 17:27:44,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:44,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] [2018-12-08 17:27:44,743 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:44,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2033999799, now seen corresponding path program 1 times [2018-12-08 17:27:44,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:44,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:44,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:44,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:44,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:44,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:27:44,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:44,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:27:44,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:27:44,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:27:44,805 INFO L87 Difference]: Start difference. First operand 6796 states and 14856 transitions. Second operand 7 states. [2018-12-08 17:27:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:44,892 INFO L93 Difference]: Finished difference Result 8554 states and 18799 transitions. [2018-12-08 17:27:44,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:27:44,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-08 17:27:44,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:44,897 INFO L225 Difference]: With dead ends: 8554 [2018-12-08 17:27:44,897 INFO L226 Difference]: Without dead ends: 8554 [2018-12-08 17:27:44,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:27:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8554 states. [2018-12-08 17:27:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8554 to 6128. [2018-12-08 17:27:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6128 states. [2018-12-08 17:27:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6128 states to 6128 states and 13324 transitions. [2018-12-08 17:27:44,942 INFO L78 Accepts]: Start accepts. Automaton has 6128 states and 13324 transitions. Word has length 96 [2018-12-08 17:27:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:44,943 INFO L480 AbstractCegarLoop]: Abstraction has 6128 states and 13324 transitions. [2018-12-08 17:27:44,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:27:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6128 states and 13324 transitions. [2018-12-08 17:27:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 17:27:44,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:44,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:44,946 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:44,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:44,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1340898102, now seen corresponding path program 1 times [2018-12-08 17:27:44,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:44,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:44,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:44,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:44,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:45,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:45,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:27:45,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:45,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:27:45,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:27:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:27:45,016 INFO L87 Difference]: Start difference. First operand 6128 states and 13324 transitions. Second operand 7 states. [2018-12-08 17:27:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:45,141 INFO L93 Difference]: Finished difference Result 6757 states and 14643 transitions. [2018-12-08 17:27:45,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:27:45,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-08 17:27:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:45,145 INFO L225 Difference]: With dead ends: 6757 [2018-12-08 17:27:45,146 INFO L226 Difference]: Without dead ends: 6757 [2018-12-08 17:27:45,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:27:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2018-12-08 17:27:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 5214. [2018-12-08 17:27:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5214 states. [2018-12-08 17:27:45,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5214 states to 5214 states and 11389 transitions. [2018-12-08 17:27:45,183 INFO L78 Accepts]: Start accepts. Automaton has 5214 states and 11389 transitions. Word has length 96 [2018-12-08 17:27:45,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:45,184 INFO L480 AbstractCegarLoop]: Abstraction has 5214 states and 11389 transitions. [2018-12-08 17:27:45,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:27:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5214 states and 11389 transitions. [2018-12-08 17:27:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 17:27:45,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:45,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:45,187 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:45,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:45,187 INFO L82 PathProgramCache]: Analyzing trace with hash -453394421, now seen corresponding path program 1 times [2018-12-08 17:27:45,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:45,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:45,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:45,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:45,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:27:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:27:45,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:27:45,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 17:27:45,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:27:45,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:27:45,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:27:45,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:27:45,282 INFO L87 Difference]: Start difference. First operand 5214 states and 11389 transitions. Second operand 11 states. [2018-12-08 17:27:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:27:47,128 INFO L93 Difference]: Finished difference Result 9915 states and 21866 transitions. [2018-12-08 17:27:47,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:27:47,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-08 17:27:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:27:47,138 INFO L225 Difference]: With dead ends: 9915 [2018-12-08 17:27:47,139 INFO L226 Difference]: Without dead ends: 6171 [2018-12-08 17:27:47,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-08 17:27:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2018-12-08 17:27:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 4642. [2018-12-08 17:27:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2018-12-08 17:27:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 10103 transitions. [2018-12-08 17:27:47,188 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 10103 transitions. Word has length 96 [2018-12-08 17:27:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:27:47,188 INFO L480 AbstractCegarLoop]: Abstraction has 4642 states and 10103 transitions. [2018-12-08 17:27:47,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:27:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 10103 transitions. [2018-12-08 17:27:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 17:27:47,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:27:47,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:27:47,191 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:27:47,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:27:47,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2018-12-08 17:27:47,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:27:47,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:47,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:27:47,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:27:47,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:27:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:27:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:27:47,228 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 17:27:47,290 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 17:27:47,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:27:47 BasicIcfg [2018-12-08 17:27:47,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:27:47,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:27:47,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:27:47,291 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:27:47,292 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:27:21" (3/4) ... [2018-12-08 17:27:47,293 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 17:27:47,362 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_70dd735e-1384-4b60-91e6-6a4e840ea10f/bin-2019/utaipan/witness.graphml [2018-12-08 17:27:47,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:27:47,363 INFO L168 Benchmark]: Toolchain (without parser) took 26151.44 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 951.3 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-08 17:27:47,364 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:27:47,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-08 17:27:47,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:27:47,364 INFO L168 Benchmark]: Boogie Preprocessor took 19.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:27:47,364 INFO L168 Benchmark]: RCFGBuilder took 346.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. [2018-12-08 17:27:47,364 INFO L168 Benchmark]: TraceAbstraction took 25347.72 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-08 17:27:47,364 INFO L168 Benchmark]: Witness Printer took 70.97 ms. Allocated memory is still 4.2 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:27:47,365 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 346.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25347.72 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 70.97 ms. Allocated memory is still 4.2 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t317; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t317, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t318; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t318, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 25.2s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8963 SDtfs, 10046 SDslu, 20218 SDs, 0 SdLazy, 8730 SolverSat, 461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 80 SyntacticMatches, 31 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 183550 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2490 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2361 ConstructedInterpolants, 0 QuantifiedInterpolants, 579333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...