./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/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 691fab8578b36371b4449c4d855bdbbbbb6262cc .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 11:59:08,741 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 11:59:08,742 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 11:59:08,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 11:59:08,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 11:59:08,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 11:59:08,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 11:59:08,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 11:59:08,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 11:59:08,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 11:59:08,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 11:59:08,756 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 11:59:08,756 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 11:59:08,757 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 11:59:08,758 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 11:59:08,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 11:59:08,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 11:59:08,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 11:59:08,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 11:59:08,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 11:59:08,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 11:59:08,764 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 11:59:08,766 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 11:59:08,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 11:59:08,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 11:59:08,767 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 11:59:08,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 11:59:08,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 11:59:08,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 11:59:08,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 11:59:08,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 11:59:08,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 11:59:08,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 11:59:08,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 11:59:08,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 11:59:08,771 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 11:59:08,771 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 11:59:08,781 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 11:59:08,782 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 11:59:08,782 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 11:59:08,782 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 11:59:08,783 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 11:59:08,783 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 11:59:08,783 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 11:59:08,783 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 11:59:08,783 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 11:59:08,783 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 11:59:08,783 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 11:59:08,784 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 11:59:08,784 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 11:59:08,784 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 11:59:08,784 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 11:59:08,785 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 11:59:08,785 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 11:59:08,785 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 11:59:08,785 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 11:59:08,785 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 11:59:08,785 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 11:59:08,785 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 11:59:08,786 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 11:59:08,786 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 11:59:08,786 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 11:59:08,786 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 11:59:08,786 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 11:59:08,786 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 11:59:08,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 11:59:08,787 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 11:59:08,787 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 11:59:08,787 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 11:59:08,787 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 11:59:08,787 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 11:59:08,787 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 11:59:08,787 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 11:59:08,788 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_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/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 -> 691fab8578b36371b4449c4d855bdbbbbb6262cc [2018-12-02 11:59:08,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 11:59:08,819 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 11:59:08,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 11:59:08,823 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 11:59:08,823 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 11:59:08,824 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_false-unreach-call.i [2018-12-02 11:59:08,866 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/bin-2019/utaipan/data/efb7a28a8/ebbb5318b81e45e890092811b3ad249a/FLAGb19fdbc20 [2018-12-02 11:59:09,196 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 11:59:09,197 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/sv-benchmarks/c/pthread-wmm/safe030_power.opt_false-unreach-call.i [2018-12-02 11:59:09,203 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/bin-2019/utaipan/data/efb7a28a8/ebbb5318b81e45e890092811b3ad249a/FLAGb19fdbc20 [2018-12-02 11:59:09,211 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/bin-2019/utaipan/data/efb7a28a8/ebbb5318b81e45e890092811b3ad249a [2018-12-02 11:59:09,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 11:59:09,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 11:59:09,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 11:59:09,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 11:59:09,217 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 11:59:09,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:59:09" (1/1) ... [2018-12-02 11:59:09,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09, skipping insertion in model container [2018-12-02 11:59:09,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:59:09" (1/1) ... [2018-12-02 11:59:09,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 11:59:09,249 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 11:59:09,436 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:59:09,477 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 11:59:09,511 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:59:09,540 INFO L195 MainTranslator]: Completed translation [2018-12-02 11:59:09,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09 WrapperNode [2018-12-02 11:59:09,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 11:59:09,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 11:59:09,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 11:59:09,541 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 11:59:09,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09" (1/1) ... [2018-12-02 11:59:09,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09" (1/1) ... [2018-12-02 11:59:09,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 11:59:09,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 11:59:09,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 11:59:09,574 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 11:59:09,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09" (1/1) ... [2018-12-02 11:59:09,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09" (1/1) ... [2018-12-02 11:59:09,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09" (1/1) ... [2018-12-02 11:59:09,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09" (1/1) ... [2018-12-02 11:59:09,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09" (1/1) ... [2018-12-02 11:59:09,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09" (1/1) ... [2018-12-02 11:59:09,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09" (1/1) ... [2018-12-02 11:59:09,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 11:59:09,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 11:59:09,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 11:59:09,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 11:59:09,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/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-02 11:59:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 11:59:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 11:59:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 11:59:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 11:59:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 11:59:09,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 11:59:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 11:59:09,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 11:59:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 11:59:09,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 11:59:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 11:59:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 11:59:09,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 11:59:09,633 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 11:59:09,933 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 11:59:09,933 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 11:59:09,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:59:09 BoogieIcfgContainer [2018-12-02 11:59:09,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 11:59:09,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 11:59:09,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 11:59:09,935 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 11:59:09,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:59:09" (1/3) ... [2018-12-02 11:59:09,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4869397c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:59:09, skipping insertion in model container [2018-12-02 11:59:09,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:09" (2/3) ... [2018-12-02 11:59:09,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4869397c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:59:09, skipping insertion in model container [2018-12-02 11:59:09,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:59:09" (3/3) ... [2018-12-02 11:59:09,937 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_false-unreach-call.i [2018-12-02 11:59:09,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,959 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,959 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,960 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,960 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,963 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,963 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,964 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,964 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,964 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:59:09,970 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 11:59:09,971 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 11:59:09,976 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 11:59:09,985 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 11:59:10,000 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 11:59:10,000 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 11:59:10,000 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 11:59:10,000 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 11:59:10,000 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 11:59:10,000 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 11:59:10,000 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 11:59:10,000 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 11:59:10,007 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154places, 191 transitions [2018-12-02 11:59:25,154 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128911 states. [2018-12-02 11:59:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 128911 states. [2018-12-02 11:59:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 11:59:25,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:59:25,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:59:25,167 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:59:25,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:59:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1836791117, now seen corresponding path program 1 times [2018-12-02 11:59:25,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:59:25,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:59:25,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:59:25,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:59:25,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:59:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:59:25,329 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-02 11:59:25,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:59:25,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:59:25,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:59:25,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:59:25,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:59:25,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:59:25,349 INFO L87 Difference]: Start difference. First operand 128911 states. Second operand 4 states. [2018-12-02 11:59:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:59:26,490 INFO L93 Difference]: Finished difference Result 233471 states and 1098323 transitions. [2018-12-02 11:59:26,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:59:26,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-02 11:59:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:59:28,812 INFO L225 Difference]: With dead ends: 233471 [2018-12-02 11:59:28,813 INFO L226 Difference]: Without dead ends: 203721 [2018-12-02 11:59:28,814 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-02 11:59:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203721 states. [2018-12-02 11:59:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203721 to 118891. [2018-12-02 11:59:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-02 11:59:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559774 transitions. [2018-12-02 11:59:32,429 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559774 transitions. Word has length 42 [2018-12-02 11:59:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:59:32,430 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559774 transitions. [2018-12-02 11:59:32,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:59:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559774 transitions. [2018-12-02 11:59:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 11:59:32,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:59:32,436 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-02 11:59:32,436 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:59:32,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:59:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1696589112, now seen corresponding path program 1 times [2018-12-02 11:59:32,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:59:32,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:59:32,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:59:32,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:59:32,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:59:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:59:32,477 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-02 11:59:32,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:59:32,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 11:59:32,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:59:32,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 11:59:32,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 11:59:32,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:59:32,479 INFO L87 Difference]: Start difference. First operand 118891 states and 559774 transitions. Second operand 3 states. [2018-12-02 11:59:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:59:33,041 INFO L93 Difference]: Finished difference Result 118891 states and 559659 transitions. [2018-12-02 11:59:33,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 11:59:33,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 11:59:33,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:59:33,344 INFO L225 Difference]: With dead ends: 118891 [2018-12-02 11:59:33,345 INFO L226 Difference]: Without dead ends: 118891 [2018-12-02 11:59:33,345 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-02 11:59:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118891 states. [2018-12-02 11:59:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118891 to 118891. [2018-12-02 11:59:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-02 11:59:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559659 transitions. [2018-12-02 11:59:35,894 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559659 transitions. Word has length 49 [2018-12-02 11:59:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:59:35,894 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559659 transitions. [2018-12-02 11:59:35,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 11:59:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559659 transitions. [2018-12-02 11:59:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 11:59:35,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:59:35,897 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-02 11:59:35,898 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:59:35,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:59:35,898 INFO L82 PathProgramCache]: Analyzing trace with hash 46221223, now seen corresponding path program 1 times [2018-12-02 11:59:35,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:59:35,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:59:35,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:59:35,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:59:35,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:59:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:59:35,946 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-02 11:59:35,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:59:35,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:59:35,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:59:35,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:59:35,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:59:35,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:59:35,948 INFO L87 Difference]: Start difference. First operand 118891 states and 559659 transitions. Second operand 5 states. [2018-12-02 11:59:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:59:37,793 INFO L93 Difference]: Finished difference Result 325271 states and 1470363 transitions. [2018-12-02 11:59:37,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:59:37,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-02 11:59:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:59:38,657 INFO L225 Difference]: With dead ends: 325271 [2018-12-02 11:59:38,657 INFO L226 Difference]: Without dead ends: 324271 [2018-12-02 11:59:38,657 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-02 11:59:42,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324271 states. [2018-12-02 11:59:45,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324271 to 186421. [2018-12-02 11:59:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186421 states. [2018-12-02 11:59:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186421 states to 186421 states and 842758 transitions. [2018-12-02 11:59:45,992 INFO L78 Accepts]: Start accepts. Automaton has 186421 states and 842758 transitions. Word has length 49 [2018-12-02 11:59:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:59:45,993 INFO L480 AbstractCegarLoop]: Abstraction has 186421 states and 842758 transitions. [2018-12-02 11:59:45,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:59:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 186421 states and 842758 transitions. [2018-12-02 11:59:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 11:59:45,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:59:45,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:59:45,997 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:59:45,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:59:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash 764594298, now seen corresponding path program 1 times [2018-12-02 11:59:45,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:59:45,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:59:45,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:59:45,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:59:45,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:59:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:59:46,040 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-02 11:59:46,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:59:46,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:59:46,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:59:46,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:59:46,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:59:46,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:59:46,041 INFO L87 Difference]: Start difference. First operand 186421 states and 842758 transitions. Second operand 4 states. [2018-12-02 11:59:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:59:46,718 INFO L93 Difference]: Finished difference Result 163597 states and 726959 transitions. [2018-12-02 11:59:46,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 11:59:46,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-02 11:59:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:59:47,540 INFO L225 Difference]: With dead ends: 163597 [2018-12-02 11:59:47,540 INFO L226 Difference]: Without dead ends: 160992 [2018-12-02 11:59:47,540 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-02 11:59:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160992 states. [2018-12-02 11:59:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160992 to 160992. [2018-12-02 11:59:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160992 states. [2018-12-02 11:59:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160992 states to 160992 states and 718277 transitions. [2018-12-02 11:59:52,766 INFO L78 Accepts]: Start accepts. Automaton has 160992 states and 718277 transitions. Word has length 50 [2018-12-02 11:59:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:59:52,766 INFO L480 AbstractCegarLoop]: Abstraction has 160992 states and 718277 transitions. [2018-12-02 11:59:52,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:59:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 160992 states and 718277 transitions. [2018-12-02 11:59:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 11:59:52,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:59:52,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:59:52,771 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:59:52,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:59:52,771 INFO L82 PathProgramCache]: Analyzing trace with hash 315183364, now seen corresponding path program 1 times [2018-12-02 11:59:52,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:59:52,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:59:52,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:59:52,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:59:52,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:59:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:59:52,811 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-02 11:59:52,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:59:52,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:59:52,812 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:59:52,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:59:52,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:59:52,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:59:52,812 INFO L87 Difference]: Start difference. First operand 160992 states and 718277 transitions. Second operand 5 states. [2018-12-02 11:59:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:59:54,423 INFO L93 Difference]: Finished difference Result 289848 states and 1287330 transitions. [2018-12-02 11:59:54,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:59:54,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-02 11:59:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:59:55,155 INFO L225 Difference]: With dead ends: 289848 [2018-12-02 11:59:55,156 INFO L226 Difference]: Without dead ends: 289008 [2018-12-02 11:59:55,156 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-02 11:59:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289008 states. [2018-12-02 12:00:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289008 to 169612. [2018-12-02 12:00:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169612 states. [2018-12-02 12:00:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169612 states to 169612 states and 753930 transitions. [2018-12-02 12:00:01,847 INFO L78 Accepts]: Start accepts. Automaton has 169612 states and 753930 transitions. Word has length 51 [2018-12-02 12:00:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:01,848 INFO L480 AbstractCegarLoop]: Abstraction has 169612 states and 753930 transitions. [2018-12-02 12:00:01,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 169612 states and 753930 transitions. [2018-12-02 12:00:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 12:00:01,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:01,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:01,867 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:01,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash 336759908, now seen corresponding path program 1 times [2018-12-02 12:00:01,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:01,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:01,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:01,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:01,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:01,927 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-02 12:00:01,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:01,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:00:01,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:01,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:00:01,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:00:01,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:00:01,928 INFO L87 Difference]: Start difference. First operand 169612 states and 753930 transitions. Second operand 6 states. [2018-12-02 12:00:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:03,723 INFO L93 Difference]: Finished difference Result 292568 states and 1275883 transitions. [2018-12-02 12:00:03,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:00:03,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-02 12:00:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:04,463 INFO L225 Difference]: With dead ends: 292568 [2018-12-02 12:00:04,463 INFO L226 Difference]: Without dead ends: 291728 [2018-12-02 12:00:04,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-02 12:00:05,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291728 states. [2018-12-02 12:00:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291728 to 164644. [2018-12-02 12:00:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164644 states. [2018-12-02 12:00:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164644 states to 164644 states and 731936 transitions. [2018-12-02 12:00:08,808 INFO L78 Accepts]: Start accepts. Automaton has 164644 states and 731936 transitions. Word has length 58 [2018-12-02 12:00:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:08,809 INFO L480 AbstractCegarLoop]: Abstraction has 164644 states and 731936 transitions. [2018-12-02 12:00:08,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:00:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 164644 states and 731936 transitions. [2018-12-02 12:00:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 12:00:08,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:08,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:08,864 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:08,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:08,864 INFO L82 PathProgramCache]: Analyzing trace with hash 655738884, now seen corresponding path program 1 times [2018-12-02 12:00:08,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:08,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:08,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:08,897 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-02 12:00:08,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:08,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:00:08,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:08,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:00:08,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:00:08,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:00:08,899 INFO L87 Difference]: Start difference. First operand 164644 states and 731936 transitions. Second operand 4 states. [2018-12-02 12:00:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:10,544 INFO L93 Difference]: Finished difference Result 264420 states and 1161188 transitions. [2018-12-02 12:00:10,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:10,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 12:00:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:11,209 INFO L225 Difference]: With dead ends: 264420 [2018-12-02 12:00:11,209 INFO L226 Difference]: Without dead ends: 263060 [2018-12-02 12:00:11,209 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-02 12:00:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263060 states. [2018-12-02 12:00:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263060 to 220276. [2018-12-02 12:00:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220276 states. [2018-12-02 12:00:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220276 states to 220276 states and 976572 transitions. [2018-12-02 12:00:18,066 INFO L78 Accepts]: Start accepts. Automaton has 220276 states and 976572 transitions. Word has length 65 [2018-12-02 12:00:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:18,066 INFO L480 AbstractCegarLoop]: Abstraction has 220276 states and 976572 transitions. [2018-12-02 12:00:18,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:00:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 220276 states and 976572 transitions. [2018-12-02 12:00:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 12:00:18,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:18,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:18,148 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:18,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2009048581, now seen corresponding path program 1 times [2018-12-02 12:00:18,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:18,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:18,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:18,207 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-02 12:00:18,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:18,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:00:18,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:18,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:18,208 INFO L87 Difference]: Start difference. First operand 220276 states and 976572 transitions. Second operand 5 states. [2018-12-02 12:00:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:18,505 INFO L93 Difference]: Finished difference Result 78044 states and 314282 transitions. [2018-12-02 12:00:18,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:00:18,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 12:00:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:18,653 INFO L225 Difference]: With dead ends: 78044 [2018-12-02 12:00:18,653 INFO L226 Difference]: Without dead ends: 75732 [2018-12-02 12:00:18,653 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-02 12:00:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75732 states. [2018-12-02 12:00:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75732 to 75732. [2018-12-02 12:00:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75732 states. [2018-12-02 12:00:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75732 states to 75732 states and 305620 transitions. [2018-12-02 12:00:19,974 INFO L78 Accepts]: Start accepts. Automaton has 75732 states and 305620 transitions. Word has length 65 [2018-12-02 12:00:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:19,974 INFO L480 AbstractCegarLoop]: Abstraction has 75732 states and 305620 transitions. [2018-12-02 12:00:19,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 75732 states and 305620 transitions. [2018-12-02 12:00:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 12:00:20,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:20,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:20,021 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:20,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:20,022 INFO L82 PathProgramCache]: Analyzing trace with hash 493391520, now seen corresponding path program 1 times [2018-12-02 12:00:20,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:20,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:20,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:20,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:20,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:20,062 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-02 12:00:20,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:20,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:00:20,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:20,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:00:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:00:20,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:00:20,062 INFO L87 Difference]: Start difference. First operand 75732 states and 305620 transitions. Second operand 4 states. [2018-12-02 12:00:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:20,526 INFO L93 Difference]: Finished difference Result 105528 states and 420009 transitions. [2018-12-02 12:00:20,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:20,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 12:00:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:20,745 INFO L225 Difference]: With dead ends: 105528 [2018-12-02 12:00:20,745 INFO L226 Difference]: Without dead ends: 105528 [2018-12-02 12:00:20,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105528 states. [2018-12-02 12:00:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105528 to 81080. [2018-12-02 12:00:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81080 states. [2018-12-02 12:00:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81080 states to 81080 states and 325641 transitions. [2018-12-02 12:00:22,201 INFO L78 Accepts]: Start accepts. Automaton has 81080 states and 325641 transitions. Word has length 78 [2018-12-02 12:00:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:22,201 INFO L480 AbstractCegarLoop]: Abstraction has 81080 states and 325641 transitions. [2018-12-02 12:00:22,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:00:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 81080 states and 325641 transitions. [2018-12-02 12:00:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 12:00:22,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:22,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:00:22,254 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:22,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:22,254 INFO L82 PathProgramCache]: Analyzing trace with hash -191355072, now seen corresponding path program 1 times [2018-12-02 12:00:22,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:22,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:22,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:22,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:22,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:22,298 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-02 12:00:22,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:22,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:00:22,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:22,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:00:22,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:00:22,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:00:22,299 INFO L87 Difference]: Start difference. First operand 81080 states and 325641 transitions. Second operand 4 states. [2018-12-02 12:00:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:23,009 INFO L93 Difference]: Finished difference Result 113667 states and 450915 transitions. [2018-12-02 12:00:23,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:23,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 12:00:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:23,240 INFO L225 Difference]: With dead ends: 113667 [2018-12-02 12:00:23,241 INFO L226 Difference]: Without dead ends: 113667 [2018-12-02 12:00:23,241 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-02 12:00:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113667 states. [2018-12-02 12:00:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113667 to 102372. [2018-12-02 12:00:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102372 states. [2018-12-02 12:00:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102372 states to 102372 states and 408718 transitions. [2018-12-02 12:00:24,948 INFO L78 Accepts]: Start accepts. Automaton has 102372 states and 408718 transitions. Word has length 78 [2018-12-02 12:00:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:24,948 INFO L480 AbstractCegarLoop]: Abstraction has 102372 states and 408718 transitions. [2018-12-02 12:00:24,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:00:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 102372 states and 408718 transitions. [2018-12-02 12:00:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 12:00:25,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:25,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:25,020 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:25,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:25,020 INFO L82 PathProgramCache]: Analyzing trace with hash 159444865, now seen corresponding path program 1 times [2018-12-02 12:00:25,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:25,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:25,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:25,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:25,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:25,061 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-02 12:00:25,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:25,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:00:25,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:25,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:00:25,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:00:25,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:00:25,062 INFO L87 Difference]: Start difference. First operand 102372 states and 408718 transitions. Second operand 6 states. [2018-12-02 12:00:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:25,129 INFO L93 Difference]: Finished difference Result 16164 states and 54990 transitions. [2018-12-02 12:00:25,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:00:25,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 12:00:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:25,147 INFO L225 Difference]: With dead ends: 16164 [2018-12-02 12:00:25,147 INFO L226 Difference]: Without dead ends: 14072 [2018-12-02 12:00:25,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:00:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14072 states. [2018-12-02 12:00:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14072 to 13537. [2018-12-02 12:00:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13537 states. [2018-12-02 12:00:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13537 states to 13537 states and 46015 transitions. [2018-12-02 12:00:25,428 INFO L78 Accepts]: Start accepts. Automaton has 13537 states and 46015 transitions. Word has length 78 [2018-12-02 12:00:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:25,428 INFO L480 AbstractCegarLoop]: Abstraction has 13537 states and 46015 transitions. [2018-12-02 12:00:25,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:00:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 13537 states and 46015 transitions. [2018-12-02 12:00:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 12:00:25,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:25,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:25,440 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:25,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:25,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2014372351, now seen corresponding path program 1 times [2018-12-02 12:00:25,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:25,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:25,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:25,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:25,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:25,491 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-02 12:00:25,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:25,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:00:25,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:25,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:25,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:25,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:25,492 INFO L87 Difference]: Start difference. First operand 13537 states and 46015 transitions. Second operand 5 states. [2018-12-02 12:00:25,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:25,642 INFO L93 Difference]: Finished difference Result 15422 states and 51828 transitions. [2018-12-02 12:00:25,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:25,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-02 12:00:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:25,660 INFO L225 Difference]: With dead ends: 15422 [2018-12-02 12:00:25,660 INFO L226 Difference]: Without dead ends: 15422 [2018-12-02 12:00:25,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15422 states. [2018-12-02 12:00:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15422 to 13947. [2018-12-02 12:00:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13947 states. [2018-12-02 12:00:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13947 states to 13947 states and 47378 transitions. [2018-12-02 12:00:25,803 INFO L78 Accepts]: Start accepts. Automaton has 13947 states and 47378 transitions. Word has length 97 [2018-12-02 12:00:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:25,803 INFO L480 AbstractCegarLoop]: Abstraction has 13947 states and 47378 transitions. [2018-12-02 12:00:25,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 13947 states and 47378 transitions. [2018-12-02 12:00:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 12:00:25,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:25,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:25,815 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:25,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1097247648, now seen corresponding path program 1 times [2018-12-02 12:00:25,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:25,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:25,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:25,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:25,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:25,866 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-02 12:00:25,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:25,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:00:25,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:25,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:00:25,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:00:25,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:00:25,867 INFO L87 Difference]: Start difference. First operand 13947 states and 47378 transitions. Second operand 6 states. [2018-12-02 12:00:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:26,107 INFO L93 Difference]: Finished difference Result 16687 states and 55800 transitions. [2018-12-02 12:00:26,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:00:26,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-02 12:00:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:26,127 INFO L225 Difference]: With dead ends: 16687 [2018-12-02 12:00:26,127 INFO L226 Difference]: Without dead ends: 16357 [2018-12-02 12:00:26,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16357 states. [2018-12-02 12:00:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16357 to 15837. [2018-12-02 12:00:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15837 states. [2018-12-02 12:00:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15837 states to 15837 states and 53450 transitions. [2018-12-02 12:00:26,285 INFO L78 Accepts]: Start accepts. Automaton has 15837 states and 53450 transitions. Word has length 97 [2018-12-02 12:00:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:26,285 INFO L480 AbstractCegarLoop]: Abstraction has 15837 states and 53450 transitions. [2018-12-02 12:00:26,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:00:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 15837 states and 53450 transitions. [2018-12-02 12:00:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 12:00:26,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:26,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:26,300 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:26,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:26,300 INFO L82 PathProgramCache]: Analyzing trace with hash -800534339, now seen corresponding path program 2 times [2018-12-02 12:00:26,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:26,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:26,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:26,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:26,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:26,343 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-02 12:00:26,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:26,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:00:26,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:26,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:26,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:26,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:26,344 INFO L87 Difference]: Start difference. First operand 15837 states and 53450 transitions. Second operand 5 states. [2018-12-02 12:00:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:26,542 INFO L93 Difference]: Finished difference Result 20664 states and 68496 transitions. [2018-12-02 12:00:26,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:26,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-02 12:00:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:26,566 INFO L225 Difference]: With dead ends: 20664 [2018-12-02 12:00:26,566 INFO L226 Difference]: Without dead ends: 20504 [2018-12-02 12:00:26,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:00:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20504 states. [2018-12-02 12:00:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20504 to 17570. [2018-12-02 12:00:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17570 states. [2018-12-02 12:00:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17570 states to 17570 states and 58965 transitions. [2018-12-02 12:00:26,755 INFO L78 Accepts]: Start accepts. Automaton has 17570 states and 58965 transitions. Word has length 97 [2018-12-02 12:00:26,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:26,755 INFO L480 AbstractCegarLoop]: Abstraction has 17570 states and 58965 transitions. [2018-12-02 12:00:26,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 17570 states and 58965 transitions. [2018-12-02 12:00:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 12:00:26,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:26,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:26,772 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:26,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:26,772 INFO L82 PathProgramCache]: Analyzing trace with hash -124487781, now seen corresponding path program 3 times [2018-12-02 12:00:26,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:26,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:00:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:26,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:26,825 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-02 12:00:26,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:26,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:00:26,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:26,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:00:26,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:00:26,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:26,826 INFO L87 Difference]: Start difference. First operand 17570 states and 58965 transitions. Second operand 7 states. [2018-12-02 12:00:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:27,099 INFO L93 Difference]: Finished difference Result 21535 states and 71009 transitions. [2018-12-02 12:00:27,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:00:27,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-02 12:00:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:27,123 INFO L225 Difference]: With dead ends: 21535 [2018-12-02 12:00:27,123 INFO L226 Difference]: Without dead ends: 21210 [2018-12-02 12:00:27,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:00:27,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21210 states. [2018-12-02 12:00:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21210 to 17585. [2018-12-02 12:00:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17585 states. [2018-12-02 12:00:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17585 states to 17585 states and 58942 transitions. [2018-12-02 12:00:27,314 INFO L78 Accepts]: Start accepts. Automaton has 17585 states and 58942 transitions. Word has length 97 [2018-12-02 12:00:27,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:27,314 INFO L480 AbstractCegarLoop]: Abstraction has 17585 states and 58942 transitions. [2018-12-02 12:00:27,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:00:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 17585 states and 58942 transitions. [2018-12-02 12:00:27,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 12:00:27,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:27,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:27,330 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:27,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2066828671, now seen corresponding path program 1 times [2018-12-02 12:00:27,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:27,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:27,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:00:27,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:27,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:27,387 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-02 12:00:27,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:27,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:00:27,387 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:27,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:00:27,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:00:27,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:00:27,388 INFO L87 Difference]: Start difference. First operand 17585 states and 58942 transitions. Second operand 6 states. [2018-12-02 12:00:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:27,513 INFO L93 Difference]: Finished difference Result 20760 states and 67307 transitions. [2018-12-02 12:00:27,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:00:27,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-02 12:00:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:27,535 INFO L225 Difference]: With dead ends: 20760 [2018-12-02 12:00:27,535 INFO L226 Difference]: Without dead ends: 20685 [2018-12-02 12:00:27,535 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-02 12:00:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20685 states. [2018-12-02 12:00:27,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20685 to 18285. [2018-12-02 12:00:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18285 states. [2018-12-02 12:00:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18285 states to 18285 states and 60187 transitions. [2018-12-02 12:00:27,723 INFO L78 Accepts]: Start accepts. Automaton has 18285 states and 60187 transitions. Word has length 97 [2018-12-02 12:00:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:27,723 INFO L480 AbstractCegarLoop]: Abstraction has 18285 states and 60187 transitions. [2018-12-02 12:00:27,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:00:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 18285 states and 60187 transitions. [2018-12-02 12:00:27,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 12:00:27,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:27,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:27,739 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:27,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:27,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1042134750, now seen corresponding path program 1 times [2018-12-02 12:00:27,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:27,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:27,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:27,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:27,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:27,793 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-02 12:00:27,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:27,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:00:27,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:27,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:27,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:27,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:27,794 INFO L87 Difference]: Start difference. First operand 18285 states and 60187 transitions. Second operand 5 states. [2018-12-02 12:00:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:27,971 INFO L93 Difference]: Finished difference Result 24187 states and 77863 transitions. [2018-12-02 12:00:27,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:00:27,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-02 12:00:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:27,997 INFO L225 Difference]: With dead ends: 24187 [2018-12-02 12:00:27,997 INFO L226 Difference]: Without dead ends: 23652 [2018-12-02 12:00:27,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:00:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23652 states. [2018-12-02 12:00:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23652 to 18930. [2018-12-02 12:00:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18930 states. [2018-12-02 12:00:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18930 states to 18930 states and 61813 transitions. [2018-12-02 12:00:28,207 INFO L78 Accepts]: Start accepts. Automaton has 18930 states and 61813 transitions. Word has length 97 [2018-12-02 12:00:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:28,207 INFO L480 AbstractCegarLoop]: Abstraction has 18930 states and 61813 transitions. [2018-12-02 12:00:28,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 18930 states and 61813 transitions. [2018-12-02 12:00:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:00:28,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:28,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:28,222 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:28,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:28,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2038420724, now seen corresponding path program 1 times [2018-12-02 12:00:28,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:28,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:28,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:28,297 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-02 12:00:28,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:28,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 12:00:28,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:28,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:00:28,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:00:28,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:00:28,298 INFO L87 Difference]: Start difference. First operand 18930 states and 61813 transitions. Second operand 9 states. [2018-12-02 12:00:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:28,941 INFO L93 Difference]: Finished difference Result 32666 states and 104934 transitions. [2018-12-02 12:00:28,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 12:00:28,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-02 12:00:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:28,979 INFO L225 Difference]: With dead ends: 32666 [2018-12-02 12:00:28,979 INFO L226 Difference]: Without dead ends: 32538 [2018-12-02 12:00:28,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-02 12:00:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32538 states. [2018-12-02 12:00:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32538 to 24258. [2018-12-02 12:00:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24258 states. [2018-12-02 12:00:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24258 states to 24258 states and 78782 transitions. [2018-12-02 12:00:29,274 INFO L78 Accepts]: Start accepts. Automaton has 24258 states and 78782 transitions. Word has length 99 [2018-12-02 12:00:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:29,274 INFO L480 AbstractCegarLoop]: Abstraction has 24258 states and 78782 transitions. [2018-12-02 12:00:29,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:00:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 24258 states and 78782 transitions. [2018-12-02 12:00:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:00:29,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:29,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:29,296 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:29,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash -793656243, now seen corresponding path program 1 times [2018-12-02 12:00:29,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:29,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:29,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:29,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-02 12:00:29,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:29,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:00:29,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:29,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:00:29,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:00:29,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:29,361 INFO L87 Difference]: Start difference. First operand 24258 states and 78782 transitions. Second operand 7 states. [2018-12-02 12:00:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:29,775 INFO L93 Difference]: Finished difference Result 38026 states and 122512 transitions. [2018-12-02 12:00:29,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:00:29,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 12:00:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:29,817 INFO L225 Difference]: With dead ends: 38026 [2018-12-02 12:00:29,817 INFO L226 Difference]: Without dead ends: 36926 [2018-12-02 12:00:29,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:00:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36926 states. [2018-12-02 12:00:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36926 to 23748. [2018-12-02 12:00:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23748 states. [2018-12-02 12:00:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23748 states to 23748 states and 76819 transitions. [2018-12-02 12:00:30,118 INFO L78 Accepts]: Start accepts. Automaton has 23748 states and 76819 transitions. Word has length 99 [2018-12-02 12:00:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:30,118 INFO L480 AbstractCegarLoop]: Abstraction has 23748 states and 76819 transitions. [2018-12-02 12:00:30,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:00:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 23748 states and 76819 transitions. [2018-12-02 12:00:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:00:30,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:30,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:30,138 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:30,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:30,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1963977170, now seen corresponding path program 1 times [2018-12-02 12:00:30,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:30,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:30,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:30,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:30,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:30,193 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-02 12:00:30,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:30,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:00:30,194 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:30,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:00:30,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:00:30,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:00:30,195 INFO L87 Difference]: Start difference. First operand 23748 states and 76819 transitions. Second operand 6 states. [2018-12-02 12:00:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:30,285 INFO L93 Difference]: Finished difference Result 17635 states and 57458 transitions. [2018-12-02 12:00:30,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:00:30,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 12:00:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:30,305 INFO L225 Difference]: With dead ends: 17635 [2018-12-02 12:00:30,305 INFO L226 Difference]: Without dead ends: 17635 [2018-12-02 12:00:30,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:00:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-02 12:00:30,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 16060. [2018-12-02 12:00:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16060 states. [2018-12-02 12:00:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16060 states to 16060 states and 52773 transitions. [2018-12-02 12:00:30,530 INFO L78 Accepts]: Start accepts. Automaton has 16060 states and 52773 transitions. Word has length 99 [2018-12-02 12:00:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:30,531 INFO L480 AbstractCegarLoop]: Abstraction has 16060 states and 52773 transitions. [2018-12-02 12:00:30,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:00:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 16060 states and 52773 transitions. [2018-12-02 12:00:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:00:30,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:30,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:30,543 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:30,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:30,543 INFO L82 PathProgramCache]: Analyzing trace with hash -456422671, now seen corresponding path program 1 times [2018-12-02 12:00:30,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:30,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:30,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:30,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:30,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:30,593 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-02 12:00:30,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:30,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:00:30,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:30,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:00:30,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:00:30,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:30,594 INFO L87 Difference]: Start difference. First operand 16060 states and 52773 transitions. Second operand 7 states. [2018-12-02 12:00:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:30,763 INFO L93 Difference]: Finished difference Result 17589 states and 57474 transitions. [2018-12-02 12:00:30,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:00:30,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 12:00:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:30,782 INFO L225 Difference]: With dead ends: 17589 [2018-12-02 12:00:30,782 INFO L226 Difference]: Without dead ends: 17589 [2018-12-02 12:00:30,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17589 states. [2018-12-02 12:00:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17589 to 15970. [2018-12-02 12:00:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15970 states. [2018-12-02 12:00:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15970 states to 15970 states and 52521 transitions. [2018-12-02 12:00:30,941 INFO L78 Accepts]: Start accepts. Automaton has 15970 states and 52521 transitions. Word has length 99 [2018-12-02 12:00:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:30,941 INFO L480 AbstractCegarLoop]: Abstraction has 15970 states and 52521 transitions. [2018-12-02 12:00:30,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:00:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 15970 states and 52521 transitions. [2018-12-02 12:00:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:00:30,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:30,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:30,955 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:30,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1639769968, now seen corresponding path program 1 times [2018-12-02 12:00:30,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:30,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:30,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:31,039 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-02 12:00:31,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:31,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:00:31,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:31,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:00:31,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:00:31,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:00:31,040 INFO L87 Difference]: Start difference. First operand 15970 states and 52521 transitions. Second operand 8 states. [2018-12-02 12:00:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:31,301 INFO L93 Difference]: Finished difference Result 20725 states and 67497 transitions. [2018-12-02 12:00:31,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:00:31,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-02 12:00:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:31,325 INFO L225 Difference]: With dead ends: 20725 [2018-12-02 12:00:31,325 INFO L226 Difference]: Without dead ends: 20597 [2018-12-02 12:00:31,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-02 12:00:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20597 states. [2018-12-02 12:00:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20597 to 16691. [2018-12-02 12:00:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16691 states. [2018-12-02 12:00:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16691 states to 16691 states and 54567 transitions. [2018-12-02 12:00:31,511 INFO L78 Accepts]: Start accepts. Automaton has 16691 states and 54567 transitions. Word has length 99 [2018-12-02 12:00:31,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:31,511 INFO L480 AbstractCegarLoop]: Abstraction has 16691 states and 54567 transitions. [2018-12-02 12:00:31,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:00:31,511 INFO L276 IsEmpty]: Start isEmpty. Operand 16691 states and 54567 transitions. [2018-12-02 12:00:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:00:31,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:31,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:31,525 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:31,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:31,525 INFO L82 PathProgramCache]: Analyzing trace with hash -678155951, now seen corresponding path program 1 times [2018-12-02 12:00:31,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:31,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:31,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:31,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:31,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:31,583 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-02 12:00:31,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:31,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:00:31,583 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:31,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:00:31,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:00:31,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:31,584 INFO L87 Difference]: Start difference. First operand 16691 states and 54567 transitions. Second operand 7 states. [2018-12-02 12:00:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:31,824 INFO L93 Difference]: Finished difference Result 22271 states and 71965 transitions. [2018-12-02 12:00:31,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:00:31,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 12:00:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:31,848 INFO L225 Difference]: With dead ends: 22271 [2018-12-02 12:00:31,848 INFO L226 Difference]: Without dead ends: 22271 [2018-12-02 12:00:31,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:00:31,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22271 states. [2018-12-02 12:00:32,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22271 to 18226. [2018-12-02 12:00:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18226 states. [2018-12-02 12:00:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18226 states to 18226 states and 59616 transitions. [2018-12-02 12:00:32,040 INFO L78 Accepts]: Start accepts. Automaton has 18226 states and 59616 transitions. Word has length 99 [2018-12-02 12:00:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:32,040 INFO L480 AbstractCegarLoop]: Abstraction has 18226 states and 59616 transitions. [2018-12-02 12:00:32,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:00:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 18226 states and 59616 transitions. [2018-12-02 12:00:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:00:32,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:32,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:32,054 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:32,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:32,054 INFO L82 PathProgramCache]: Analyzing trace with hash 566608530, now seen corresponding path program 1 times [2018-12-02 12:00:32,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:32,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:32,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:32,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:32,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:32,112 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-02 12:00:32,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:32,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:00:32,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:32,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:32,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:32,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:32,113 INFO L87 Difference]: Start difference. First operand 18226 states and 59616 transitions. Second operand 5 states. [2018-12-02 12:00:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:32,194 INFO L93 Difference]: Finished difference Result 27347 states and 90700 transitions. [2018-12-02 12:00:32,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:32,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-02 12:00:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:32,226 INFO L225 Difference]: With dead ends: 27347 [2018-12-02 12:00:32,226 INFO L226 Difference]: Without dead ends: 27347 [2018-12-02 12:00:32,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:00:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27347 states. [2018-12-02 12:00:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27347 to 16676. [2018-12-02 12:00:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16676 states. [2018-12-02 12:00:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16676 states to 16676 states and 53990 transitions. [2018-12-02 12:00:32,430 INFO L78 Accepts]: Start accepts. Automaton has 16676 states and 53990 transitions. Word has length 99 [2018-12-02 12:00:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:32,430 INFO L480 AbstractCegarLoop]: Abstraction has 16676 states and 53990 transitions. [2018-12-02 12:00:32,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 16676 states and 53990 transitions. [2018-12-02 12:00:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:00:32,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:32,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:32,443 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:32,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:32,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1047324946, now seen corresponding path program 1 times [2018-12-02 12:00:32,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:32,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:32,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:32,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:32,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:32,506 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-02 12:00:32,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:32,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:00:32,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:32,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:00:32,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:00:32,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:00:32,507 INFO L87 Difference]: Start difference. First operand 16676 states and 53990 transitions. Second operand 6 states. [2018-12-02 12:00:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:32,637 INFO L93 Difference]: Finished difference Result 14948 states and 47542 transitions. [2018-12-02 12:00:32,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:00:32,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 12:00:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:32,653 INFO L225 Difference]: With dead ends: 14948 [2018-12-02 12:00:32,653 INFO L226 Difference]: Without dead ends: 14948 [2018-12-02 12:00:32,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:00:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14948 states. [2018-12-02 12:00:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14948 to 11537. [2018-12-02 12:00:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11537 states. [2018-12-02 12:00:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 37526 transitions. [2018-12-02 12:00:32,775 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 37526 transitions. Word has length 99 [2018-12-02 12:00:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:32,775 INFO L480 AbstractCegarLoop]: Abstraction has 11537 states and 37526 transitions. [2018-12-02 12:00:32,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:00:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 37526 transitions. [2018-12-02 12:00:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 12:00:32,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:32,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:32,785 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:32,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1543607272, now seen corresponding path program 1 times [2018-12-02 12:00:32,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:32,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:32,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:32,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:32,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:32,831 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-02 12:00:32,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:32,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:00:32,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:32,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:32,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:32,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:32,832 INFO L87 Difference]: Start difference. First operand 11537 states and 37526 transitions. Second operand 5 states. [2018-12-02 12:00:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:32,955 INFO L93 Difference]: Finished difference Result 12945 states and 42038 transitions. [2018-12-02 12:00:32,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:00:32,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-02 12:00:32,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:32,969 INFO L225 Difference]: With dead ends: 12945 [2018-12-02 12:00:32,969 INFO L226 Difference]: Without dead ends: 12817 [2018-12-02 12:00:32,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12817 states. [2018-12-02 12:00:33,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12817 to 11729. [2018-12-02 12:00:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11729 states. [2018-12-02 12:00:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11729 states to 11729 states and 38086 transitions. [2018-12-02 12:00:33,099 INFO L78 Accepts]: Start accepts. Automaton has 11729 states and 38086 transitions. Word has length 101 [2018-12-02 12:00:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:33,100 INFO L480 AbstractCegarLoop]: Abstraction has 11729 states and 38086 transitions. [2018-12-02 12:00:33,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 11729 states and 38086 transitions. [2018-12-02 12:00:33,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 12:00:33,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:33,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:33,109 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:33,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:33,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1506595543, now seen corresponding path program 1 times [2018-12-02 12:00:33,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:33,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:33,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:33,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:33,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:33,164 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-02 12:00:33,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:33,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:00:33,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:33,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:00:33,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:00:33,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:33,165 INFO L87 Difference]: Start difference. First operand 11729 states and 38086 transitions. Second operand 7 states. [2018-12-02 12:00:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:33,357 INFO L93 Difference]: Finished difference Result 22201 states and 72476 transitions. [2018-12-02 12:00:33,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:00:33,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-02 12:00:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:33,370 INFO L225 Difference]: With dead ends: 22201 [2018-12-02 12:00:33,370 INFO L226 Difference]: Without dead ends: 11329 [2018-12-02 12:00:33,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:00:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11329 states. [2018-12-02 12:00:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11329 to 11069. [2018-12-02 12:00:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11069 states. [2018-12-02 12:00:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11069 states to 11069 states and 36166 transitions. [2018-12-02 12:00:33,472 INFO L78 Accepts]: Start accepts. Automaton has 11069 states and 36166 transitions. Word has length 101 [2018-12-02 12:00:33,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:33,472 INFO L480 AbstractCegarLoop]: Abstraction has 11069 states and 36166 transitions. [2018-12-02 12:00:33,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:00:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 11069 states and 36166 transitions. [2018-12-02 12:00:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 12:00:33,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:33,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:33,481 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:33,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:33,481 INFO L82 PathProgramCache]: Analyzing trace with hash -321724473, now seen corresponding path program 2 times [2018-12-02 12:00:33,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:33,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:33,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:33,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:33,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:33,551 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-02 12:00:33,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:33,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:00:33,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:33,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:00:33,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:00:33,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:33,552 INFO L87 Difference]: Start difference. First operand 11069 states and 36166 transitions. Second operand 7 states. [2018-12-02 12:00:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:33,756 INFO L93 Difference]: Finished difference Result 18645 states and 61540 transitions. [2018-12-02 12:00:33,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:00:33,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-02 12:00:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:33,766 INFO L225 Difference]: With dead ends: 18645 [2018-12-02 12:00:33,766 INFO L226 Difference]: Without dead ends: 7616 [2018-12-02 12:00:33,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:00:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2018-12-02 12:00:33,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7616. [2018-12-02 12:00:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7616 states. [2018-12-02 12:00:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7616 states to 7616 states and 25482 transitions. [2018-12-02 12:00:33,840 INFO L78 Accepts]: Start accepts. Automaton has 7616 states and 25482 transitions. Word has length 101 [2018-12-02 12:00:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:33,840 INFO L480 AbstractCegarLoop]: Abstraction has 7616 states and 25482 transitions. [2018-12-02 12:00:33,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:00:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 7616 states and 25482 transitions. [2018-12-02 12:00:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 12:00:33,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:33,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:33,847 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:33,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:33,848 INFO L82 PathProgramCache]: Analyzing trace with hash 773161459, now seen corresponding path program 3 times [2018-12-02 12:00:33,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:33,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:00:33,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:33,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:33,958 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-02 12:00:33,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:33,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 12:00:33,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:33,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:00:33,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:00:33,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:00:33,959 INFO L87 Difference]: Start difference. First operand 7616 states and 25482 transitions. Second operand 12 states. [2018-12-02 12:00:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:34,368 INFO L93 Difference]: Finished difference Result 14444 states and 48675 transitions. [2018-12-02 12:00:34,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 12:00:34,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-12-02 12:00:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:34,381 INFO L225 Difference]: With dead ends: 14444 [2018-12-02 12:00:34,381 INFO L226 Difference]: Without dead ends: 10540 [2018-12-02 12:00:34,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 12:00:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2018-12-02 12:00:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 9860. [2018-12-02 12:00:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9860 states. [2018-12-02 12:00:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 32373 transitions. [2018-12-02 12:00:34,475 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 32373 transitions. Word has length 101 [2018-12-02 12:00:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:34,475 INFO L480 AbstractCegarLoop]: Abstraction has 9860 states and 32373 transitions. [2018-12-02 12:00:34,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:00:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 32373 transitions. [2018-12-02 12:00:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 12:00:34,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:34,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:00:34,483 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:00:34,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash -350606857, now seen corresponding path program 4 times [2018-12-02 12:00:34,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:34,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:34,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:00:34,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:34,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:00:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:00:34,517 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:00:34,581 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 12:00:34,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:00:34 BasicIcfg [2018-12-02 12:00:34,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:00:34,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:00:34,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:00:34,583 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:00:34,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:59:09" (3/4) ... [2018-12-02 12:00:34,585 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 12:00:34,651 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ab9f3346-45e6-4cd1-801a-f7d1939a2d42/bin-2019/utaipan/witness.graphml [2018-12-02 12:00:34,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:00:34,652 INFO L168 Benchmark]: Toolchain (without parser) took 85438.04 ms. Allocated memory was 1.0 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 957.1 MB in the beginning and 4.2 GB in the end (delta: -3.3 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-12-02 12:00:34,653 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:00:34,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-02 12:00:34,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.24 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 12:00:34,653 INFO L168 Benchmark]: Boogie Preprocessor took 20.39 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-02 12:00:34,653 INFO L168 Benchmark]: RCFGBuilder took 338.29 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: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2018-12-02 12:00:34,653 INFO L168 Benchmark]: TraceAbstraction took 84648.74 ms. Allocated memory was 1.2 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-12-02 12:00:34,653 INFO L168 Benchmark]: Witness Printer took 68.72 ms. Allocated memory is still 8.1 GB. Free memory was 4.3 GB in the beginning and 4.2 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2018-12-02 12:00:34,654 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.24 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.39 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 338.29 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: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 84648.74 ms. Allocated memory was 1.2 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 68.72 ms. Allocated memory is still 8.1 GB. Free memory was 4.3 GB in the beginning and 4.2 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L674] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L676] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L679] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L680] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L681] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L682] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L683] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L689] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L690] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L691] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L692] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L693] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L694] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L697] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L698] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] -1 pthread_t t2494; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] FCALL, FORK -1 pthread_create(&t2494, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t2495; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t2495, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t2496; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t2496, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 y$w_buff1 = y$w_buff0 [L738] 0 y$w_buff0 = 2 [L739] 0 y$w_buff1_used = y$w_buff0_used [L740] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L743] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L744] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L745] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L746] 0 y$r_buff0_thd3 = (_Bool)1 [L749] 0 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L702] 1 z = 2 [L705] 1 x = 1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L717] 2 x = 2 [L720] 2 y = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L753] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L759] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L724] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L724] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L725] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L726] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L730] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] -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) [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L786] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L787] -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 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L788] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] -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 [L792] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L793] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L794] -1 y$flush_delayed = weak$$choice2 [L795] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L798] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L802] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] -1 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y = y$flush_delayed ? y$mem_tmp : y [L805] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 197 locations, 3 error locations. UNSAFE Result, 84.5s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 22.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7297 SDtfs, 7436 SDslu, 17105 SDs, 0 SdLazy, 6449 SolverSat, 442 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 102 SyntacticMatches, 13 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220276occurred in iteration=7, 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: 44.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 612611 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2542 NumberOfCodeBlocks, 2542 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2412 ConstructedInterpolants, 0 QuantifiedInterpolants, 545836 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...