./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_pso.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_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/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 c5225c06c798b79433014bd7aed4e3fee4a02538 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 12:01:13,745 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:01:13,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:01:13,753 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:01:13,754 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:01:13,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:01:13,755 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:01:13,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:01:13,756 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:01:13,757 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:01:13,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:01:13,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:01:13,758 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:01:13,759 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:01:13,759 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:01:13,760 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:01:13,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:01:13,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:01:13,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:01:13,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:01:13,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:01:13,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:01:13,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:01:13,767 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:01:13,767 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:01:13,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:01:13,768 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:01:13,769 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:01:13,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:01:13,770 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:01:13,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:01:13,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:01:13,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:01:13,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:01:13,772 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:01:13,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:01:13,772 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 12:01:13,779 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:01:13,779 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:01:13,780 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:01:13,780 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:01:13,780 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:01:13,780 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:01:13,780 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:01:13,780 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:01:13,780 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:01:13,780 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:01:13,781 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:01:13,781 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:01:13,781 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:01:13,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:01:13,781 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:01:13,781 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:01:13,781 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:01:13,781 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:01:13,781 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:01:13,782 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:01:13,782 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:01:13,782 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:01:13,782 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:01:13,782 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:01:13,782 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:01:13,782 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:01:13,782 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:01:13,782 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:01:13,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:01:13,782 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:01:13,782 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:01:13,782 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:01:13,783 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:01:13,783 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:01:13,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:01:13,783 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 12:01:13,783 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_5801a0ea-7be0-4843-ab14-17abacebfcb8/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 -> c5225c06c798b79433014bd7aed4e3fee4a02538 [2018-12-09 12:01:13,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:01:13,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:01:13,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:01:13,818 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:01:13,819 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:01:13,819 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix033_pso.opt_false-unreach-call.i [2018-12-09 12:01:13,860 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/data/f1536d5ec/7b3ebbdaf7084244843030a34a7c20ea/FLAGf2cd09aa9 [2018-12-09 12:01:14,331 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:01:14,332 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/sv-benchmarks/c/pthread-wmm/mix033_pso.opt_false-unreach-call.i [2018-12-09 12:01:14,339 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/data/f1536d5ec/7b3ebbdaf7084244843030a34a7c20ea/FLAGf2cd09aa9 [2018-12-09 12:01:14,350 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/data/f1536d5ec/7b3ebbdaf7084244843030a34a7c20ea [2018-12-09 12:01:14,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:01:14,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:01:14,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:01:14,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:01:14,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:01:14,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:01:14" (1/1) ... [2018-12-09 12:01:14,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14, skipping insertion in model container [2018-12-09 12:01:14,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:01:14" (1/1) ... [2018-12-09 12:01:14,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:01:14,392 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:01:14,592 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:01:14,600 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:01:14,693 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:01:14,743 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:01:14,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14 WrapperNode [2018-12-09 12:01:14,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:01:14,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:01:14,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:01:14,744 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:01:14,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14" (1/1) ... [2018-12-09 12:01:14,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14" (1/1) ... [2018-12-09 12:01:14,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:01:14,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:01:14,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:01:14,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:01:14,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14" (1/1) ... [2018-12-09 12:01:14,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14" (1/1) ... [2018-12-09 12:01:14,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14" (1/1) ... [2018-12-09 12:01:14,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14" (1/1) ... [2018-12-09 12:01:14,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14" (1/1) ... [2018-12-09 12:01:14,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14" (1/1) ... [2018-12-09 12:01:14,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14" (1/1) ... [2018-12-09 12:01:14,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:01:14,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:01:14,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:01:14,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:01:14,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:01:14,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:01:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:01:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 12:01:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:01:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 12:01:14,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 12:01:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 12:01:14,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 12:01:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 12:01:14,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 12:01:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 12:01:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:01:14,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:01:14,828 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 12:01:15,109 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:01:15,109 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 12:01:15,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:15 BoogieIcfgContainer [2018-12-09 12:01:15,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:01:15,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:01:15,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:01:15,112 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:01:15,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:01:14" (1/3) ... [2018-12-09 12:01:15,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a476192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:01:15, skipping insertion in model container [2018-12-09 12:01:15,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:14" (2/3) ... [2018-12-09 12:01:15,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a476192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:01:15, skipping insertion in model container [2018-12-09 12:01:15,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:15" (3/3) ... [2018-12-09 12:01:15,114 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_pso.opt_false-unreach-call.i [2018-12-09 12:01:15,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,137 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,137 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,147 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,147 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,148 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,148 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,148 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:15,157 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 12:01:15,157 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:01:15,162 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 12:01:15,171 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 12:01:15,185 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:01:15,186 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:01:15,186 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:01:15,186 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:01:15,186 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:01:15,186 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:01:15,186 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:01:15,186 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:01:15,192 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148places, 179 transitions [2018-12-09 12:01:34,430 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149047 states. [2018-12-09 12:01:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 149047 states. [2018-12-09 12:01:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 12:01:34,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:34,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] [2018-12-09 12:01:34,440 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:34,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:34,444 INFO L82 PathProgramCache]: Analyzing trace with hash -552567723, now seen corresponding path program 1 times [2018-12-09 12:01:34,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:34,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:34,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:34,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:34,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:34,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:34,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:01:34,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:34,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:01:34,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:01:34,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:34,617 INFO L87 Difference]: Start difference. First operand 149047 states. Second operand 4 states. [2018-12-09 12:01:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:35,979 INFO L93 Difference]: Finished difference Result 257067 states and 1188606 transitions. [2018-12-09 12:01:35,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:01:35,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-09 12:01:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:36,601 INFO L225 Difference]: With dead ends: 257067 [2018-12-09 12:01:36,601 INFO L226 Difference]: Without dead ends: 174817 [2018-12-09 12:01:36,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174817 states. [2018-12-09 12:01:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174817 to 110557. [2018-12-09 12:01:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110557 states. [2018-12-09 12:01:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110557 states to 110557 states and 511488 transitions. [2018-12-09 12:01:41,819 INFO L78 Accepts]: Start accepts. Automaton has 110557 states and 511488 transitions. Word has length 48 [2018-12-09 12:01:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:41,820 INFO L480 AbstractCegarLoop]: Abstraction has 110557 states and 511488 transitions. [2018-12-09 12:01:41,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:01:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 110557 states and 511488 transitions. [2018-12-09 12:01:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 12:01:41,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:41,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:41,833 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:41,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1274372901, now seen corresponding path program 1 times [2018-12-09 12:01:41,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:41,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:41,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:41,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:41,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:41,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:41,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:01:41,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:41,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:01:41,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:01:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:01:41,903 INFO L87 Difference]: Start difference. First operand 110557 states and 511488 transitions. Second operand 3 states. [2018-12-09 12:01:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:42,479 INFO L93 Difference]: Finished difference Result 110557 states and 511383 transitions. [2018-12-09 12:01:42,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:01:42,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-09 12:01:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:42,767 INFO L225 Difference]: With dead ends: 110557 [2018-12-09 12:01:42,767 INFO L226 Difference]: Without dead ends: 110557 [2018-12-09 12:01:42,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:01:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110557 states. [2018-12-09 12:01:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110557 to 110557. [2018-12-09 12:01:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110557 states. [2018-12-09 12:01:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110557 states to 110557 states and 511383 transitions. [2018-12-09 12:01:45,489 INFO L78 Accepts]: Start accepts. Automaton has 110557 states and 511383 transitions. Word has length 56 [2018-12-09 12:01:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:45,489 INFO L480 AbstractCegarLoop]: Abstraction has 110557 states and 511383 transitions. [2018-12-09 12:01:45,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:01:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 110557 states and 511383 transitions. [2018-12-09 12:01:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 12:01:45,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:45,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:45,497 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:45,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:45,498 INFO L82 PathProgramCache]: Analyzing trace with hash 468437434, now seen corresponding path program 1 times [2018-12-09 12:01:45,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:45,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:45,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:45,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:45,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:45,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:45,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:01:45,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:45,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:01:45,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:01:45,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:45,543 INFO L87 Difference]: Start difference. First operand 110557 states and 511383 transitions. Second operand 4 states. [2018-12-09 12:01:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:45,994 INFO L93 Difference]: Finished difference Result 99455 states and 448608 transitions. [2018-12-09 12:01:45,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:01:45,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 12:01:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:46,244 INFO L225 Difference]: With dead ends: 99455 [2018-12-09 12:01:46,245 INFO L226 Difference]: Without dead ends: 95225 [2018-12-09 12:01:46,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:01:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95225 states. [2018-12-09 12:01:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95225 to 95225. [2018-12-09 12:01:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95225 states. [2018-12-09 12:01:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95225 states to 95225 states and 432992 transitions. [2018-12-09 12:01:48,582 INFO L78 Accepts]: Start accepts. Automaton has 95225 states and 432992 transitions. Word has length 56 [2018-12-09 12:01:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:48,582 INFO L480 AbstractCegarLoop]: Abstraction has 95225 states and 432992 transitions. [2018-12-09 12:01:48,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:01:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 95225 states and 432992 transitions. [2018-12-09 12:01:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 12:01:48,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:48,588 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] [2018-12-09 12:01:48,589 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:48,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1865372316, now seen corresponding path program 1 times [2018-12-09 12:01:48,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:48,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:48,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:48,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:48,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:48,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:48,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:01:48,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:48,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:01:48,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:01:48,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:01:48,645 INFO L87 Difference]: Start difference. First operand 95225 states and 432992 transitions. Second operand 5 states. [2018-12-09 12:01:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:48,782 INFO L93 Difference]: Finished difference Result 30969 states and 124172 transitions. [2018-12-09 12:01:48,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:01:48,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-09 12:01:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:48,838 INFO L225 Difference]: With dead ends: 30969 [2018-12-09 12:01:48,838 INFO L226 Difference]: Without dead ends: 27341 [2018-12-09 12:01:48,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:01:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27341 states. [2018-12-09 12:01:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27341 to 26881. [2018-12-09 12:01:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26881 states. [2018-12-09 12:01:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26881 states to 26881 states and 107654 transitions. [2018-12-09 12:01:49,215 INFO L78 Accepts]: Start accepts. Automaton has 26881 states and 107654 transitions. Word has length 57 [2018-12-09 12:01:49,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:49,215 INFO L480 AbstractCegarLoop]: Abstraction has 26881 states and 107654 transitions. [2018-12-09 12:01:49,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:01:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 26881 states and 107654 transitions. [2018-12-09 12:01:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 12:01:49,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:49,217 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] [2018-12-09 12:01:49,217 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:49,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:49,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1683293826, now seen corresponding path program 1 times [2018-12-09 12:01:49,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:49,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:49,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:49,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:49,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:49,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:49,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:01:49,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:49,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:01:49,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:01:49,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:01:49,282 INFO L87 Difference]: Start difference. First operand 26881 states and 107654 transitions. Second operand 6 states. [2018-12-09 12:01:49,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:49,595 INFO L93 Difference]: Finished difference Result 37433 states and 146191 transitions. [2018-12-09 12:01:49,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:01:49,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-09 12:01:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:49,667 INFO L225 Difference]: With dead ends: 37433 [2018-12-09 12:01:49,667 INFO L226 Difference]: Without dead ends: 37058 [2018-12-09 12:01:49,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:01:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37058 states. [2018-12-09 12:01:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37058 to 35274. [2018-12-09 12:01:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35274 states. [2018-12-09 12:01:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35274 states to 35274 states and 138749 transitions. [2018-12-09 12:01:51,125 INFO L78 Accepts]: Start accepts. Automaton has 35274 states and 138749 transitions. Word has length 57 [2018-12-09 12:01:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:51,125 INFO L480 AbstractCegarLoop]: Abstraction has 35274 states and 138749 transitions. [2018-12-09 12:01:51,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:01:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 35274 states and 138749 transitions. [2018-12-09 12:01:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 12:01:51,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:51,129 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] [2018-12-09 12:01:51,129 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:51,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash -674729880, now seen corresponding path program 1 times [2018-12-09 12:01:51,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:51,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:51,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:51,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:51,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:01:51,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:51,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:01:51,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:01:51,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:01:51,157 INFO L87 Difference]: Start difference. First operand 35274 states and 138749 transitions. Second operand 3 states. [2018-12-09 12:01:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:51,322 INFO L93 Difference]: Finished difference Result 46814 states and 182041 transitions. [2018-12-09 12:01:51,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:01:51,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-09 12:01:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:51,408 INFO L225 Difference]: With dead ends: 46814 [2018-12-09 12:01:51,408 INFO L226 Difference]: Without dead ends: 46794 [2018-12-09 12:01:51,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:01:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46794 states. [2018-12-09 12:01:51,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46794 to 36256. [2018-12-09 12:01:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36256 states. [2018-12-09 12:01:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36256 states to 36256 states and 141456 transitions. [2018-12-09 12:01:51,986 INFO L78 Accepts]: Start accepts. Automaton has 36256 states and 141456 transitions. Word has length 59 [2018-12-09 12:01:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:51,986 INFO L480 AbstractCegarLoop]: Abstraction has 36256 states and 141456 transitions. [2018-12-09 12:01:51,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:01:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 36256 states and 141456 transitions. [2018-12-09 12:01:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 12:01:51,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:51,990 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] [2018-12-09 12:01:51,990 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:51,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:51,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2071932979, now seen corresponding path program 1 times [2018-12-09 12:01:51,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:51,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:51,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:51,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:51,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:52,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:52,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:01:52,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:52,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:01:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:01:52,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:01:52,056 INFO L87 Difference]: Start difference. First operand 36256 states and 141456 transitions. Second operand 6 states. [2018-12-09 12:01:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:52,472 INFO L93 Difference]: Finished difference Result 50348 states and 193878 transitions. [2018-12-09 12:01:52,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:01:52,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-09 12:01:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:52,569 INFO L225 Difference]: With dead ends: 50348 [2018-12-09 12:01:52,569 INFO L226 Difference]: Without dead ends: 49863 [2018-12-09 12:01:52,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:01:52,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49863 states. [2018-12-09 12:01:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49863 to 39290. [2018-12-09 12:01:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39290 states. [2018-12-09 12:01:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39290 states to 39290 states and 153277 transitions. [2018-12-09 12:01:53,383 INFO L78 Accepts]: Start accepts. Automaton has 39290 states and 153277 transitions. Word has length 63 [2018-12-09 12:01:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:53,383 INFO L480 AbstractCegarLoop]: Abstraction has 39290 states and 153277 transitions. [2018-12-09 12:01:53,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:01:53,384 INFO L276 IsEmpty]: Start isEmpty. Operand 39290 states and 153277 transitions. [2018-12-09 12:01:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 12:01:53,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:53,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:53,400 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:53,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -276513334, now seen corresponding path program 1 times [2018-12-09 12:01:53,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:53,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:53,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:53,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:53,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:53,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:53,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:01:53,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:53,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:01:53,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:01:53,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:53,439 INFO L87 Difference]: Start difference. First operand 39290 states and 153277 transitions. Second operand 4 states. [2018-12-09 12:01:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:53,666 INFO L93 Difference]: Finished difference Result 46153 states and 179280 transitions. [2018-12-09 12:01:53,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:01:53,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-09 12:01:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:53,750 INFO L225 Difference]: With dead ends: 46153 [2018-12-09 12:01:53,750 INFO L226 Difference]: Without dead ends: 46153 [2018-12-09 12:01:53,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:01:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46153 states. [2018-12-09 12:01:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46153 to 42185. [2018-12-09 12:01:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42185 states. [2018-12-09 12:01:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42185 states to 42185 states and 164112 transitions. [2018-12-09 12:01:54,356 INFO L78 Accepts]: Start accepts. Automaton has 42185 states and 164112 transitions. Word has length 74 [2018-12-09 12:01:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:54,356 INFO L480 AbstractCegarLoop]: Abstraction has 42185 states and 164112 transitions. [2018-12-09 12:01:54,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:01:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 42185 states and 164112 transitions. [2018-12-09 12:01:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 12:01:54,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:54,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:54,374 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:54,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1466297001, now seen corresponding path program 1 times [2018-12-09 12:01:54,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:54,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:54,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:54,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:54,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:54,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:54,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:01:54,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:54,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:01:54,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:01:54,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:01:54,433 INFO L87 Difference]: Start difference. First operand 42185 states and 164112 transitions. Second operand 6 states. [2018-12-09 12:01:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:55,017 INFO L93 Difference]: Finished difference Result 91408 states and 351791 transitions. [2018-12-09 12:01:55,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 12:01:55,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-09 12:01:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:55,193 INFO L225 Difference]: With dead ends: 91408 [2018-12-09 12:01:55,193 INFO L226 Difference]: Without dead ends: 91088 [2018-12-09 12:01:55,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 12:01:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91088 states. [2018-12-09 12:01:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91088 to 55498. [2018-12-09 12:01:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55498 states. [2018-12-09 12:01:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55498 states to 55498 states and 213500 transitions. [2018-12-09 12:01:56,338 INFO L78 Accepts]: Start accepts. Automaton has 55498 states and 213500 transitions. Word has length 74 [2018-12-09 12:01:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:56,338 INFO L480 AbstractCegarLoop]: Abstraction has 55498 states and 213500 transitions. [2018-12-09 12:01:56,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:01:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 55498 states and 213500 transitions. [2018-12-09 12:01:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 12:01:56,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:56,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:56,366 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:56,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:56,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1987377366, now seen corresponding path program 1 times [2018-12-09 12:01:56,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:56,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:56,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:56,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:56,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:01:56,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:56,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:01:56,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:01:56,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:56,408 INFO L87 Difference]: Start difference. First operand 55498 states and 213500 transitions. Second operand 4 states. [2018-12-09 12:01:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:56,757 INFO L93 Difference]: Finished difference Result 70629 states and 268392 transitions. [2018-12-09 12:01:56,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:01:56,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-09 12:01:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:56,897 INFO L225 Difference]: With dead ends: 70629 [2018-12-09 12:01:56,897 INFO L226 Difference]: Without dead ends: 70629 [2018-12-09 12:01:56,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:57,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70629 states. [2018-12-09 12:01:57,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70629 to 63993. [2018-12-09 12:01:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63993 states. [2018-12-09 12:01:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63993 states to 63993 states and 243820 transitions. [2018-12-09 12:01:57,831 INFO L78 Accepts]: Start accepts. Automaton has 63993 states and 243820 transitions. Word has length 76 [2018-12-09 12:01:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:57,831 INFO L480 AbstractCegarLoop]: Abstraction has 63993 states and 243820 transitions. [2018-12-09 12:01:57,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:01:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 63993 states and 243820 transitions. [2018-12-09 12:01:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 12:01:57,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:57,867 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:57,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:57,868 INFO L82 PathProgramCache]: Analyzing trace with hash -89831977, now seen corresponding path program 1 times [2018-12-09 12:01:57,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:57,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:57,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:57,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:57,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:57,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:57,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:01:57,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:57,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:01:57,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:01:57,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:01:57,894 INFO L87 Difference]: Start difference. First operand 63993 states and 243820 transitions. Second operand 3 states. [2018-12-09 12:01:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:58,360 INFO L93 Difference]: Finished difference Result 66627 states and 253017 transitions. [2018-12-09 12:01:58,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:01:58,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-09 12:01:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:58,486 INFO L225 Difference]: With dead ends: 66627 [2018-12-09 12:01:58,486 INFO L226 Difference]: Without dead ends: 66627 [2018-12-09 12:01:58,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:01:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66627 states. [2018-12-09 12:01:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66627 to 65439. [2018-12-09 12:01:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65439 states. [2018-12-09 12:01:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65439 states to 65439 states and 248840 transitions. [2018-12-09 12:01:59,369 INFO L78 Accepts]: Start accepts. Automaton has 65439 states and 248840 transitions. Word has length 76 [2018-12-09 12:01:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:59,370 INFO L480 AbstractCegarLoop]: Abstraction has 65439 states and 248840 transitions. [2018-12-09 12:01:59,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:01:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 65439 states and 248840 transitions. [2018-12-09 12:01:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:01:59,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:59,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:59,417 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:59,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:59,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2086484495, now seen corresponding path program 1 times [2018-12-09 12:01:59,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:59,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:59,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:59,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:59,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:59,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:59,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:01:59,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:59,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:01:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:01:59,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:01:59,472 INFO L87 Difference]: Start difference. First operand 65439 states and 248840 transitions. Second operand 6 states. [2018-12-09 12:02:00,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:00,092 INFO L93 Difference]: Finished difference Result 79698 states and 299735 transitions. [2018-12-09 12:02:00,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:02:00,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 12:02:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:00,240 INFO L225 Difference]: With dead ends: 79698 [2018-12-09 12:02:00,240 INFO L226 Difference]: Without dead ends: 79698 [2018-12-09 12:02:00,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:02:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79698 states. [2018-12-09 12:02:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79698 to 75406. [2018-12-09 12:02:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75406 states. [2018-12-09 12:02:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75406 states to 75406 states and 284925 transitions. [2018-12-09 12:02:01,486 INFO L78 Accepts]: Start accepts. Automaton has 75406 states and 284925 transitions. Word has length 78 [2018-12-09 12:02:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:01,486 INFO L480 AbstractCegarLoop]: Abstraction has 75406 states and 284925 transitions. [2018-12-09 12:02:01,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:02:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 75406 states and 284925 transitions. [2018-12-09 12:02:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:02:01,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:01,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:02:01,536 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:01,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:01,536 INFO L82 PathProgramCache]: Analyzing trace with hash 9275152, now seen corresponding path program 1 times [2018-12-09 12:02:01,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:01,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:01,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:02:01,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:01,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:01,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:01,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:02:01,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:01,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:02:01,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:02:01,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:02:01,591 INFO L87 Difference]: Start difference. First operand 75406 states and 284925 transitions. Second operand 6 states. [2018-12-09 12:02:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:02,079 INFO L93 Difference]: Finished difference Result 88588 states and 326142 transitions. [2018-12-09 12:02:02,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:02:02,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 12:02:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:02,245 INFO L225 Difference]: With dead ends: 88588 [2018-12-09 12:02:02,246 INFO L226 Difference]: Without dead ends: 88588 [2018-12-09 12:02:02,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:02:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88588 states. [2018-12-09 12:02:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88588 to 76931. [2018-12-09 12:02:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76931 states. [2018-12-09 12:02:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76931 states to 76931 states and 285924 transitions. [2018-12-09 12:02:03,394 INFO L78 Accepts]: Start accepts. Automaton has 76931 states and 285924 transitions. Word has length 78 [2018-12-09 12:02:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:03,394 INFO L480 AbstractCegarLoop]: Abstraction has 76931 states and 285924 transitions. [2018-12-09 12:02:03,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:02:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 76931 states and 285924 transitions. [2018-12-09 12:02:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:02:03,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:03,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:02:03,441 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:03,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:03,442 INFO L82 PathProgramCache]: Analyzing trace with hash 220626065, now seen corresponding path program 1 times [2018-12-09 12:02:03,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:03,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:03,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:02:03,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:03,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:03,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:03,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:02:03,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:03,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:02:03,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:02:03,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:02:03,491 INFO L87 Difference]: Start difference. First operand 76931 states and 285924 transitions. Second operand 5 states. [2018-12-09 12:02:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:04,100 INFO L93 Difference]: Finished difference Result 97024 states and 358812 transitions. [2018-12-09 12:02:04,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:02:04,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-09 12:02:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:04,276 INFO L225 Difference]: With dead ends: 97024 [2018-12-09 12:02:04,276 INFO L226 Difference]: Without dead ends: 97024 [2018-12-09 12:02:04,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:02:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97024 states. [2018-12-09 12:02:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97024 to 82886. [2018-12-09 12:02:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82886 states. [2018-12-09 12:02:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82886 states to 82886 states and 305942 transitions. [2018-12-09 12:02:05,475 INFO L78 Accepts]: Start accepts. Automaton has 82886 states and 305942 transitions. Word has length 78 [2018-12-09 12:02:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:05,476 INFO L480 AbstractCegarLoop]: Abstraction has 82886 states and 305942 transitions. [2018-12-09 12:02:05,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:02:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 82886 states and 305942 transitions. [2018-12-09 12:02:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:02:05,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:05,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:02:05,526 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:05,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:05,527 INFO L82 PathProgramCache]: Analyzing trace with hash -289908112, now seen corresponding path program 1 times [2018-12-09 12:02:05,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:05,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:02:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:05,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:05,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:05,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:02:05,568 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:05,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:02:05,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:02:05,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:02:05,568 INFO L87 Difference]: Start difference. First operand 82886 states and 305942 transitions. Second operand 5 states. [2018-12-09 12:02:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:06,192 INFO L93 Difference]: Finished difference Result 112009 states and 412190 transitions. [2018-12-09 12:02:06,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:02:06,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-09 12:02:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:06,414 INFO L225 Difference]: With dead ends: 112009 [2018-12-09 12:02:06,414 INFO L226 Difference]: Without dead ends: 112009 [2018-12-09 12:02:06,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:02:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112009 states. [2018-12-09 12:02:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112009 to 87819. [2018-12-09 12:02:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87819 states. [2018-12-09 12:02:07,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87819 states to 87819 states and 324136 transitions. [2018-12-09 12:02:07,929 INFO L78 Accepts]: Start accepts. Automaton has 87819 states and 324136 transitions. Word has length 78 [2018-12-09 12:02:07,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:07,930 INFO L480 AbstractCegarLoop]: Abstraction has 87819 states and 324136 transitions. [2018-12-09 12:02:07,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:02:07,930 INFO L276 IsEmpty]: Start isEmpty. Operand 87819 states and 324136 transitions. [2018-12-09 12:02:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:02:07,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:07,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:02:07,981 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:07,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:07,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2097362575, now seen corresponding path program 1 times [2018-12-09 12:02:07,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:07,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:07,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:02:07,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:07,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:08,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:08,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:02:08,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:08,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:02:08,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:02:08,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:02:08,021 INFO L87 Difference]: Start difference. First operand 87819 states and 324136 transitions. Second operand 6 states. [2018-12-09 12:02:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:08,144 INFO L93 Difference]: Finished difference Result 31979 states and 101192 transitions. [2018-12-09 12:02:08,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:02:08,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 12:02:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:08,181 INFO L225 Difference]: With dead ends: 31979 [2018-12-09 12:02:08,181 INFO L226 Difference]: Without dead ends: 25698 [2018-12-09 12:02:08,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:02:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25698 states. [2018-12-09 12:02:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25698 to 22278. [2018-12-09 12:02:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22278 states. [2018-12-09 12:02:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22278 states to 22278 states and 69699 transitions. [2018-12-09 12:02:08,441 INFO L78 Accepts]: Start accepts. Automaton has 22278 states and 69699 transitions. Word has length 78 [2018-12-09 12:02:08,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:08,441 INFO L480 AbstractCegarLoop]: Abstraction has 22278 states and 69699 transitions. [2018-12-09 12:02:08,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:02:08,441 INFO L276 IsEmpty]: Start isEmpty. Operand 22278 states and 69699 transitions. [2018-12-09 12:02:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 12:02:08,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:08,463 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] [2018-12-09 12:02:08,463 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:08,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:08,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2022569740, now seen corresponding path program 1 times [2018-12-09 12:02:08,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:08,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:08,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:02:08,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:08,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:08,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:08,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:02:08,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:08,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:02:08,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:02:08,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:02:08,526 INFO L87 Difference]: Start difference. First operand 22278 states and 69699 transitions. Second operand 5 states. [2018-12-09 12:02:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:08,716 INFO L93 Difference]: Finished difference Result 25922 states and 80261 transitions. [2018-12-09 12:02:08,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:02:08,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 12:02:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:08,748 INFO L225 Difference]: With dead ends: 25922 [2018-12-09 12:02:08,748 INFO L226 Difference]: Without dead ends: 25752 [2018-12-09 12:02:08,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:02:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25752 states. [2018-12-09 12:02:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25752 to 23068. [2018-12-09 12:02:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23068 states. [2018-12-09 12:02:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23068 states to 23068 states and 71891 transitions. [2018-12-09 12:02:09,008 INFO L78 Accepts]: Start accepts. Automaton has 23068 states and 71891 transitions. Word has length 93 [2018-12-09 12:02:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:09,008 INFO L480 AbstractCegarLoop]: Abstraction has 23068 states and 71891 transitions. [2018-12-09 12:02:09,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:02:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 23068 states and 71891 transitions. [2018-12-09 12:02:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 12:02:09,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:09,031 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] [2018-12-09 12:02:09,031 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:09,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash 279372632, now seen corresponding path program 2 times [2018-12-09 12:02:09,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:09,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:09,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:02:09,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:09,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:09,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:09,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:02:09,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:09,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:02:09,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:02:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:02:09,079 INFO L87 Difference]: Start difference. First operand 23068 states and 71891 transitions. Second operand 6 states. [2018-12-09 12:02:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:09,302 INFO L93 Difference]: Finished difference Result 22022 states and 68143 transitions. [2018-12-09 12:02:09,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:02:09,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 12:02:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:09,325 INFO L225 Difference]: With dead ends: 22022 [2018-12-09 12:02:09,325 INFO L226 Difference]: Without dead ends: 22022 [2018-12-09 12:02:09,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:02:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2018-12-09 12:02:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 19768. [2018-12-09 12:02:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19768 states. [2018-12-09 12:02:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19768 states to 19768 states and 61041 transitions. [2018-12-09 12:02:09,541 INFO L78 Accepts]: Start accepts. Automaton has 19768 states and 61041 transitions. Word has length 93 [2018-12-09 12:02:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:09,541 INFO L480 AbstractCegarLoop]: Abstraction has 19768 states and 61041 transitions. [2018-12-09 12:02:09,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:02:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 19768 states and 61041 transitions. [2018-12-09 12:02:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 12:02:09,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:09,561 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] [2018-12-09 12:02:09,561 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:09,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash 757086651, now seen corresponding path program 1 times [2018-12-09 12:02:09,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:09,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:09,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:02:09,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:09,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:09,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:09,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:02:09,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:09,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:02:09,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:02:09,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:02:09,629 INFO L87 Difference]: Start difference. First operand 19768 states and 61041 transitions. Second operand 6 states. [2018-12-09 12:02:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:09,695 INFO L93 Difference]: Finished difference Result 19832 states and 60673 transitions. [2018-12-09 12:02:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:02:09,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 12:02:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:09,717 INFO L225 Difference]: With dead ends: 19832 [2018-12-09 12:02:09,717 INFO L226 Difference]: Without dead ends: 19832 [2018-12-09 12:02:09,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:02:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19832 states. [2018-12-09 12:02:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19832 to 12643. [2018-12-09 12:02:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12643 states. [2018-12-09 12:02:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12643 states to 12643 states and 38855 transitions. [2018-12-09 12:02:09,889 INFO L78 Accepts]: Start accepts. Automaton has 12643 states and 38855 transitions. Word has length 93 [2018-12-09 12:02:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:09,890 INFO L480 AbstractCegarLoop]: Abstraction has 12643 states and 38855 transitions. [2018-12-09 12:02:09,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:02:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 12643 states and 38855 transitions. [2018-12-09 12:02:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:02:09,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:09,902 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] [2018-12-09 12:02:09,902 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:09,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:09,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1737823134, now seen corresponding path program 1 times [2018-12-09 12:02:09,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:09,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:09,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:02:09,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:09,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:09,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:09,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:02:09,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:09,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:02:09,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:02:09,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:02:09,959 INFO L87 Difference]: Start difference. First operand 12643 states and 38855 transitions. Second operand 7 states. [2018-12-09 12:02:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:10,163 INFO L93 Difference]: Finished difference Result 14994 states and 45866 transitions. [2018-12-09 12:02:10,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:02:10,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 12:02:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:10,179 INFO L225 Difference]: With dead ends: 14994 [2018-12-09 12:02:10,179 INFO L226 Difference]: Without dead ends: 14894 [2018-12-09 12:02:10,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:02:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14894 states. [2018-12-09 12:02:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14894 to 12678. [2018-12-09 12:02:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12678 states. [2018-12-09 12:02:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12678 states to 12678 states and 38953 transitions. [2018-12-09 12:02:10,319 INFO L78 Accepts]: Start accepts. Automaton has 12678 states and 38953 transitions. Word has length 95 [2018-12-09 12:02:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:10,319 INFO L480 AbstractCegarLoop]: Abstraction has 12678 states and 38953 transitions. [2018-12-09 12:02:10,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:02:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 12678 states and 38953 transitions. [2018-12-09 12:02:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:02:10,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:10,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] [2018-12-09 12:02:10,331 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:10,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash -339386209, now seen corresponding path program 1 times [2018-12-09 12:02:10,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:10,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:02:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:10,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:10,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:10,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:02:10,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:10,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:02:10,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:02:10,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:02:10,415 INFO L87 Difference]: Start difference. First operand 12678 states and 38953 transitions. Second operand 7 states. [2018-12-09 12:02:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:10,568 INFO L93 Difference]: Finished difference Result 14785 states and 45416 transitions. [2018-12-09 12:02:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:02:10,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 12:02:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:10,591 INFO L225 Difference]: With dead ends: 14785 [2018-12-09 12:02:10,591 INFO L226 Difference]: Without dead ends: 14785 [2018-12-09 12:02:10,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:02:10,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14785 states. [2018-12-09 12:02:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14785 to 14721. [2018-12-09 12:02:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14721 states. [2018-12-09 12:02:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14721 states to 14721 states and 45208 transitions. [2018-12-09 12:02:10,757 INFO L78 Accepts]: Start accepts. Automaton has 14721 states and 45208 transitions. Word has length 95 [2018-12-09 12:02:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:10,757 INFO L480 AbstractCegarLoop]: Abstraction has 14721 states and 45208 transitions. [2018-12-09 12:02:10,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:02:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 14721 states and 45208 transitions. [2018-12-09 12:02:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:02:10,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:10,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] [2018-12-09 12:02:10,771 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:10,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:10,771 INFO L82 PathProgramCache]: Analyzing trace with hash 548117472, now seen corresponding path program 1 times [2018-12-09 12:02:10,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:10,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:10,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:02:10,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:10,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:10,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:10,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 12:02:10,857 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:10,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 12:02:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 12:02:10,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:02:10,858 INFO L87 Difference]: Start difference. First operand 14721 states and 45208 transitions. Second operand 10 states. [2018-12-09 12:02:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:11,427 INFO L93 Difference]: Finished difference Result 26297 states and 81005 transitions. [2018-12-09 12:02:11,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:02:11,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-12-09 12:02:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:11,445 INFO L225 Difference]: With dead ends: 26297 [2018-12-09 12:02:11,445 INFO L226 Difference]: Without dead ends: 16466 [2018-12-09 12:02:11,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-09 12:02:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16466 states. [2018-12-09 12:02:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16466 to 14281. [2018-12-09 12:02:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14281 states. [2018-12-09 12:02:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14281 states to 14281 states and 43341 transitions. [2018-12-09 12:02:11,600 INFO L78 Accepts]: Start accepts. Automaton has 14281 states and 43341 transitions. Word has length 95 [2018-12-09 12:02:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:11,601 INFO L480 AbstractCegarLoop]: Abstraction has 14281 states and 43341 transitions. [2018-12-09 12:02:11,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 12:02:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 14281 states and 43341 transitions. [2018-12-09 12:02:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:02:11,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:11,614 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] [2018-12-09 12:02:11,614 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:11,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:11,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1346988258, now seen corresponding path program 2 times [2018-12-09 12:02:11,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:11,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:11,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:02:11,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:11,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:11,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:11,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 12:02:11,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:11,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 12:02:11,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 12:02:11,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:02:11,691 INFO L87 Difference]: Start difference. First operand 14281 states and 43341 transitions. Second operand 10 states. [2018-12-09 12:02:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:12,133 INFO L93 Difference]: Finished difference Result 25629 states and 77408 transitions. [2018-12-09 12:02:12,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:02:12,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-12-09 12:02:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:12,146 INFO L225 Difference]: With dead ends: 25629 [2018-12-09 12:02:12,147 INFO L226 Difference]: Without dead ends: 12077 [2018-12-09 12:02:12,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-09 12:02:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12077 states. [2018-12-09 12:02:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12077 to 12077. [2018-12-09 12:02:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12077 states. [2018-12-09 12:02:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12077 states to 12077 states and 36273 transitions. [2018-12-09 12:02:12,270 INFO L78 Accepts]: Start accepts. Automaton has 12077 states and 36273 transitions. Word has length 95 [2018-12-09 12:02:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:12,271 INFO L480 AbstractCegarLoop]: Abstraction has 12077 states and 36273 transitions. [2018-12-09 12:02:12,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 12:02:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 12077 states and 36273 transitions. [2018-12-09 12:02:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:02:12,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:12,281 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] [2018-12-09 12:02:12,281 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:12,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1462199036, now seen corresponding path program 3 times [2018-12-09 12:02:12,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:12,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:12,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:02:12,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:12,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:12,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:12,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:02:12,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:12,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:02:12,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:02:12,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:02:12,361 INFO L87 Difference]: Start difference. First operand 12077 states and 36273 transitions. Second operand 7 states. [2018-12-09 12:02:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:12,670 INFO L93 Difference]: Finished difference Result 20802 states and 62747 transitions. [2018-12-09 12:02:12,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:02:12,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 12:02:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:12,679 INFO L225 Difference]: With dead ends: 20802 [2018-12-09 12:02:12,679 INFO L226 Difference]: Without dead ends: 8744 [2018-12-09 12:02:12,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:02:12,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8744 states. [2018-12-09 12:02:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8744 to 8744. [2018-12-09 12:02:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8744 states. [2018-12-09 12:02:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8744 states to 8744 states and 26557 transitions. [2018-12-09 12:02:12,755 INFO L78 Accepts]: Start accepts. Automaton has 8744 states and 26557 transitions. Word has length 95 [2018-12-09 12:02:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:12,755 INFO L480 AbstractCegarLoop]: Abstraction has 8744 states and 26557 transitions. [2018-12-09 12:02:12,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:02:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 8744 states and 26557 transitions. [2018-12-09 12:02:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:02:12,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:12,762 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] [2018-12-09 12:02:12,762 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:12,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1492546748, now seen corresponding path program 2 times [2018-12-09 12:02:12,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:12,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:12,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:02:12,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:12,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:12,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:12,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:02:12,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:12,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:02:12,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:02:12,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:02:12,830 INFO L87 Difference]: Start difference. First operand 8744 states and 26557 transitions. Second operand 7 states. [2018-12-09 12:02:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:13,020 INFO L93 Difference]: Finished difference Result 9394 states and 28590 transitions. [2018-12-09 12:02:13,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:02:13,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 12:02:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:13,030 INFO L225 Difference]: With dead ends: 9394 [2018-12-09 12:02:13,030 INFO L226 Difference]: Without dead ends: 9394 [2018-12-09 12:02:13,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:02:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9394 states. [2018-12-09 12:02:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9394 to 8634. [2018-12-09 12:02:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8634 states. [2018-12-09 12:02:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8634 states to 8634 states and 26312 transitions. [2018-12-09 12:02:13,110 INFO L78 Accepts]: Start accepts. Automaton has 8634 states and 26312 transitions. Word has length 95 [2018-12-09 12:02:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:13,110 INFO L480 AbstractCegarLoop]: Abstraction has 8634 states and 26312 transitions. [2018-12-09 12:02:13,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:02:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 8634 states and 26312 transitions. [2018-12-09 12:02:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:02:13,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:13,117 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] [2018-12-09 12:02:13,117 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:13,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:13,118 INFO L82 PathProgramCache]: Analyzing trace with hash -833560456, now seen corresponding path program 3 times [2018-12-09 12:02:13,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:13,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:13,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:02:13,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:13,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:13,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:13,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:02:13,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:13,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:02:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:02:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:02:13,169 INFO L87 Difference]: Start difference. First operand 8634 states and 26312 transitions. Second operand 7 states. [2018-12-09 12:02:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:13,425 INFO L93 Difference]: Finished difference Result 13334 states and 40369 transitions. [2018-12-09 12:02:13,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 12:02:13,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 12:02:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:13,440 INFO L225 Difference]: With dead ends: 13334 [2018-12-09 12:02:13,440 INFO L226 Difference]: Without dead ends: 12974 [2018-12-09 12:02:13,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:02:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12974 states. [2018-12-09 12:02:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12974 to 8858. [2018-12-09 12:02:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8858 states. [2018-12-09 12:02:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8858 states to 8858 states and 26792 transitions. [2018-12-09 12:02:13,551 INFO L78 Accepts]: Start accepts. Automaton has 8858 states and 26792 transitions. Word has length 95 [2018-12-09 12:02:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:13,552 INFO L480 AbstractCegarLoop]: Abstraction has 8858 states and 26792 transitions. [2018-12-09 12:02:13,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:02:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8858 states and 26792 transitions. [2018-12-09 12:02:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:02:13,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:13,559 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] [2018-12-09 12:02:13,559 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:13,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:13,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1384197497, now seen corresponding path program 2 times [2018-12-09 12:02:13,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:13,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:13,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:02:13,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:13,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:13,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:13,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:02:13,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:13,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:02:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:02:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:02:13,642 INFO L87 Difference]: Start difference. First operand 8858 states and 26792 transitions. Second operand 8 states. [2018-12-09 12:02:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:13,818 INFO L93 Difference]: Finished difference Result 10230 states and 31041 transitions. [2018-12-09 12:02:13,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:02:13,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-09 12:02:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:13,828 INFO L225 Difference]: With dead ends: 10230 [2018-12-09 12:02:13,828 INFO L226 Difference]: Without dead ends: 10230 [2018-12-09 12:02:13,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:02:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10230 states. [2018-12-09 12:02:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10230 to 8918. [2018-12-09 12:02:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8918 states. [2018-12-09 12:02:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 27001 transitions. [2018-12-09 12:02:13,913 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 27001 transitions. Word has length 95 [2018-12-09 12:02:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:13,913 INFO L480 AbstractCegarLoop]: Abstraction has 8918 states and 27001 transitions. [2018-12-09 12:02:13,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:02:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 27001 transitions. [2018-12-09 12:02:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:02:13,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:13,920 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] [2018-12-09 12:02:13,920 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:13,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:13,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2023266118, now seen corresponding path program 4 times [2018-12-09 12:02:13,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:13,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:13,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:02:13,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:13,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:02:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:02:14,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:02:14,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 12:02:14,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:02:14,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 12:02:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 12:02:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:02:14,011 INFO L87 Difference]: Start difference. First operand 8918 states and 27001 transitions. Second operand 11 states. [2018-12-09 12:02:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:02:15,378 INFO L93 Difference]: Finished difference Result 17434 states and 53280 transitions. [2018-12-09 12:02:15,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:02:15,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-09 12:02:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:02:15,403 INFO L225 Difference]: With dead ends: 17434 [2018-12-09 12:02:15,403 INFO L226 Difference]: Without dead ends: 10428 [2018-12-09 12:02:15,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-09 12:02:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10428 states. [2018-12-09 12:02:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10428 to 8828. [2018-12-09 12:02:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8828 states. [2018-12-09 12:02:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8828 states to 8828 states and 26753 transitions. [2018-12-09 12:02:15,526 INFO L78 Accepts]: Start accepts. Automaton has 8828 states and 26753 transitions. Word has length 95 [2018-12-09 12:02:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:02:15,526 INFO L480 AbstractCegarLoop]: Abstraction has 8828 states and 26753 transitions. [2018-12-09 12:02:15,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 12:02:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 8828 states and 26753 transitions. [2018-12-09 12:02:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:02:15,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:02:15,534 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] [2018-12-09 12:02:15,534 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:02:15,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:02:15,534 INFO L82 PathProgramCache]: Analyzing trace with hash 452153496, now seen corresponding path program 5 times [2018-12-09 12:02:15,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:02:15,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:15,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:02:15,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:02:15,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:02:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:02:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:02:15,573 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:02:15,644 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 12:02:15,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:02:15 BasicIcfg [2018-12-09 12:02:15,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:02:15,645 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:02:15,645 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:02:15,645 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:02:15,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:15" (3/4) ... [2018-12-09 12:02:15,647 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:02:15,723 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5801a0ea-7be0-4843-ab14-17abacebfcb8/bin-2019/utaipan/witness.graphml [2018-12-09 12:02:15,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:02:15,723 INFO L168 Benchmark]: Toolchain (without parser) took 61371.06 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 948.1 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 855.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:02:15,724 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:02:15,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-09 12:02:15,725 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 12:02:15,725 INFO L168 Benchmark]: Boogie Preprocessor took 19.72 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-09 12:02:15,725 INFO L168 Benchmark]: RCFGBuilder took 314.16 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: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2018-12-09 12:02:15,725 INFO L168 Benchmark]: TraceAbstraction took 60534.72 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 784.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:02:15,726 INFO L168 Benchmark]: Witness Printer took 77.99 ms. Allocated memory is still 4.6 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2018-12-09 12:02:15,727 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.72 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 314.16 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: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60534.72 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 784.9 MB. Max. memory is 11.5 GB. * Witness Printer took 77.99 ms. Allocated memory is still 4.6 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L684] -1 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L685] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L686] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L688] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L690] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L692] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L693] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L694] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L695] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L696] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L697] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L698] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L699] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L700] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L701] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L702] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L703] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L704] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L705] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L706] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L707] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L708] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L709] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L710] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] -1 pthread_t t884; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK -1 pthread_create(&t884, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] -1 pthread_t t885; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK -1 pthread_create(&t885, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] -1 pthread_t t886; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK -1 pthread_create(&t886, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 0 z$w_buff1 = z$w_buff0 [L764] 0 z$w_buff0 = 1 [L765] 0 z$w_buff1_used = z$w_buff0_used [L766] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L769] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L770] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L771] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L772] 0 z$r_buff0_thd3 = (_Bool)1 [L775] 0 a = 1 [L778] 0 __unbuffered_p2_EAX = a [L781] 0 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L714] 1 b = 1 [L717] 1 x = 1 [L722] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L729] 2 x = 2 [L732] 2 y = 1 [L735] 2 __unbuffered_p1_EAX = y [L738] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L739] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L740] 2 z$flush_delayed = weak$$choice2 [L741] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L742] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L743] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L744] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L745] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L746] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L748] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L750] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 z = z$flush_delayed ? z$mem_tmp : z [L751] 2 z$flush_delayed = (_Bool)0 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 221 locations, 3 error locations. UNSAFE Result, 60.4s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 14.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7615 SDtfs, 9845 SDslu, 18855 SDs, 0 SdLazy, 6895 SolverSat, 334 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 79 SyntacticMatches, 22 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149047occurred in iteration=0, 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: 24.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 217074 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2315 NumberOfCodeBlocks, 2315 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2192 ConstructedInterpolants, 0 QuantifiedInterpolants, 459073 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...