./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/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 016d4db321352277c69af3257fac86162fa30707 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 00:24:57,741 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:24:57,742 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:24:57,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:24:57,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:24:57,748 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:24:57,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:24:57,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:24:57,750 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:24:57,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:24:57,751 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:24:57,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:24:57,752 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:24:57,752 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:24:57,753 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:24:57,753 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:24:57,754 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:24:57,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:24:57,756 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:24:57,756 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:24:57,757 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:24:57,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:24:57,759 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:24:57,759 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:24:57,759 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:24:57,759 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:24:57,760 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:24:57,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:24:57,760 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:24:57,761 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:24:57,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:24:57,761 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:24:57,762 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:24:57,762 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:24:57,762 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:24:57,763 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:24:57,763 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:24:57,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:24:57,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:24:57,770 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:24:57,770 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:24:57,770 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:24:57,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:24:57,771 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:24:57,771 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:24:57,771 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:24:57,771 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:24:57,771 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:24:57,771 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:24:57,771 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:24:57,771 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:24:57,771 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:24:57,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:24:57,772 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:24:57,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:24:57,772 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:24:57,772 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:24:57,772 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:24:57,772 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:24:57,772 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:24:57,772 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:24:57,772 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:24:57,772 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:24:57,772 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:24:57,773 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:24:57,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:24:57,773 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:24:57,773 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:24:57,773 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:24:57,773 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:24:57,773 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:24:57,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:24:57,773 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:24:57,773 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_84f45434-67e9-44de-9e62-b96410695409/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 -> 016d4db321352277c69af3257fac86162fa30707 [2018-12-09 00:24:57,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:24:57,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:24:57,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:24:57,800 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:24:57,801 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:24:57,801 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix033_rmo.opt_false-unreach-call.i [2018-12-09 00:24:57,837 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/bin-2019/utaipan/data/6ef282f45/dfd90ec314674e9486e6a1f449b8bd7e/FLAG1b57e47cb [2018-12-09 00:24:58,309 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:24:58,309 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/sv-benchmarks/c/pthread-wmm/mix033_rmo.opt_false-unreach-call.i [2018-12-09 00:24:58,317 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/bin-2019/utaipan/data/6ef282f45/dfd90ec314674e9486e6a1f449b8bd7e/FLAG1b57e47cb [2018-12-09 00:24:58,326 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/bin-2019/utaipan/data/6ef282f45/dfd90ec314674e9486e6a1f449b8bd7e [2018-12-09 00:24:58,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:24:58,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:24:58,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:24:58,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:24:58,332 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:24:58,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:24:58" (1/1) ... [2018-12-09 00:24:58,335 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:24:58, skipping insertion in model container [2018-12-09 00:24:58,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:24:58" (1/1) ... [2018-12-09 00:24:58,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:24:58,367 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:24:58,585 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:24:58,595 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:24:58,682 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:24:58,717 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:24:58,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:58 WrapperNode [2018-12-09 00:24:58,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:24:58,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:24:58,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:24:58,719 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:24:58,724 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:24:58" (1/1) ... [2018-12-09 00:24:58,737 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:24:58" (1/1) ... [2018-12-09 00:24:58,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:24:58,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:24:58,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:24:58,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:24:58,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:58" (1/1) ... [2018-12-09 00:24:58,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:58" (1/1) ... [2018-12-09 00:24:58,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:58" (1/1) ... [2018-12-09 00:24:58,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:58" (1/1) ... [2018-12-09 00:24:58,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:58" (1/1) ... [2018-12-09 00:24:58,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:58" (1/1) ... [2018-12-09 00:24:58,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:58" (1/1) ... [2018-12-09 00:24:58,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:24:58,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:24:58,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:24:58,783 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:24:58,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/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 00:24:58,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:24:58,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:24:58,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 00:24:58,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:24:58,817 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 00:24:58,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 00:24:58,817 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 00:24:58,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 00:24:58,818 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 00:24:58,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 00:24:58,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 00:24:58,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:24:58,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:24:58,819 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 00:24:59,143 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:24:59,143 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 00:24:59,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:24:59 BoogieIcfgContainer [2018-12-09 00:24:59,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:24:59,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:24:59,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:24:59,146 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:24:59,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:24:58" (1/3) ... [2018-12-09 00:24:59,146 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:24:59, skipping insertion in model container [2018-12-09 00:24:59,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:58" (2/3) ... [2018-12-09 00:24:59,147 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:24:59, skipping insertion in model container [2018-12-09 00:24:59,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:24:59" (3/3) ... [2018-12-09 00:24:59,148 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_rmo.opt_false-unreach-call.i [2018-12-09 00:24:59,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,171 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,171 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,172 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,173 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,173 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,173 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,173 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,173 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,173 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,173 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,173 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,173 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,173 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,179 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,179 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,179 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,179 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,179 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,179 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,179 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,179 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,179 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,180 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,180 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,180 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,180 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,180 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,180 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,180 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,180 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,182 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,182 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,182 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,182 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,182 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,183 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,183 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,183 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:24:59,191 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 00:24:59,192 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:24:59,199 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 00:24:59,211 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 00:24:59,226 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:24:59,226 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:24:59,226 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:24:59,226 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:24:59,226 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:24:59,226 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:24:59,226 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:24:59,226 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:24:59,233 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148places, 179 transitions [2018-12-09 00:25:17,819 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149047 states. [2018-12-09 00:25:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 149047 states. [2018-12-09 00:25:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:25:17,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:17,828 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 00:25:17,830 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:17,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash -552567723, now seen corresponding path program 1 times [2018-12-09 00:25:17,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:25:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:17,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:17,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:25:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:17,987 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 00:25:17,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:17,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:25:17,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:25:17,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:25:18,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:25:18,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:25:18,002 INFO L87 Difference]: Start difference. First operand 149047 states. Second operand 4 states. [2018-12-09 00:25:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:19,614 INFO L93 Difference]: Finished difference Result 257067 states and 1188606 transitions. [2018-12-09 00:25:19,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:25:19,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-09 00:25:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:20,253 INFO L225 Difference]: With dead ends: 257067 [2018-12-09 00:25:20,253 INFO L226 Difference]: Without dead ends: 174817 [2018-12-09 00:25:20,255 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 00:25:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174817 states. [2018-12-09 00:25:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174817 to 110557. [2018-12-09 00:25:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110557 states. [2018-12-09 00:25:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110557 states to 110557 states and 511488 transitions. [2018-12-09 00:25:25,396 INFO L78 Accepts]: Start accepts. Automaton has 110557 states and 511488 transitions. Word has length 48 [2018-12-09 00:25:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:25,397 INFO L480 AbstractCegarLoop]: Abstraction has 110557 states and 511488 transitions. [2018-12-09 00:25:25,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:25:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 110557 states and 511488 transitions. [2018-12-09 00:25:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:25:25,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:25,408 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 00:25:25,409 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:25,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:25,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1274372901, now seen corresponding path program 1 times [2018-12-09 00:25:25,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:25:25,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:25,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:25,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:25,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:25:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:25,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:25,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:25:25,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:25:25,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:25:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:25:25,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:25:25,462 INFO L87 Difference]: Start difference. First operand 110557 states and 511488 transitions. Second operand 3 states. [2018-12-09 00:25:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:26,053 INFO L93 Difference]: Finished difference Result 110557 states and 511383 transitions. [2018-12-09 00:25:26,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:25:26,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-09 00:25:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:26,361 INFO L225 Difference]: With dead ends: 110557 [2018-12-09 00:25:26,361 INFO L226 Difference]: Without dead ends: 110557 [2018-12-09 00:25:26,362 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 00:25:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110557 states. [2018-12-09 00:25:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110557 to 110557. [2018-12-09 00:25:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110557 states. [2018-12-09 00:25:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110557 states to 110557 states and 511383 transitions. [2018-12-09 00:25:29,014 INFO L78 Accepts]: Start accepts. Automaton has 110557 states and 511383 transitions. Word has length 56 [2018-12-09 00:25:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:29,014 INFO L480 AbstractCegarLoop]: Abstraction has 110557 states and 511383 transitions. [2018-12-09 00:25:29,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:25:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 110557 states and 511383 transitions. [2018-12-09 00:25:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:25:29,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:29,024 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 00:25:29,025 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:29,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:29,025 INFO L82 PathProgramCache]: Analyzing trace with hash 468437434, now seen corresponding path program 1 times [2018-12-09 00:25:29,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:25:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:29,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:29,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:25:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:29,091 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 00:25:29,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:29,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:25:29,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:25:29,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:25:29,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:25:29,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:25:29,092 INFO L87 Difference]: Start difference. First operand 110557 states and 511383 transitions. Second operand 5 states. [2018-12-09 00:25:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:30,346 INFO L93 Difference]: Finished difference Result 240607 states and 1068638 transitions. [2018-12-09 00:25:30,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:25:30,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-09 00:25:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:30,981 INFO L225 Difference]: With dead ends: 240607 [2018-12-09 00:25:30,981 INFO L226 Difference]: Without dead ends: 237057 [2018-12-09 00:25:30,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:25:34,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237057 states. [2018-12-09 00:25:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237057 to 160437. [2018-12-09 00:25:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160437 states. [2018-12-09 00:25:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160437 states to 160437 states and 716827 transitions. [2018-12-09 00:25:36,998 INFO L78 Accepts]: Start accepts. Automaton has 160437 states and 716827 transitions. Word has length 56 [2018-12-09 00:25:36,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:36,999 INFO L480 AbstractCegarLoop]: Abstraction has 160437 states and 716827 transitions. [2018-12-09 00:25:36,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:25:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 160437 states and 716827 transitions. [2018-12-09 00:25:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 00:25:37,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:37,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:25:37,007 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:37,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:37,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1683293826, now seen corresponding path program 1 times [2018-12-09 00:25:37,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:25:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:37,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:37,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:37,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:25:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:37,052 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 00:25:37,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:37,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:25:37,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:25:37,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:25:37,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:25:37,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:25:37,053 INFO L87 Difference]: Start difference. First operand 160437 states and 716827 transitions. Second operand 5 states. [2018-12-09 00:25:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:39,106 INFO L93 Difference]: Finished difference Result 317177 states and 1405159 transitions. [2018-12-09 00:25:39,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:25:39,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-09 00:25:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:39,964 INFO L225 Difference]: With dead ends: 317177 [2018-12-09 00:25:39,964 INFO L226 Difference]: Without dead ends: 314277 [2018-12-09 00:25:39,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:25:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314277 states. [2018-12-09 00:25:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314277 to 178277. [2018-12-09 00:25:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178277 states. [2018-12-09 00:25:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178277 states to 178277 states and 791364 transitions. [2018-12-09 00:25:47,678 INFO L78 Accepts]: Start accepts. Automaton has 178277 states and 791364 transitions. Word has length 57 [2018-12-09 00:25:47,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:47,679 INFO L480 AbstractCegarLoop]: Abstraction has 178277 states and 791364 transitions. [2018-12-09 00:25:47,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:25:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 178277 states and 791364 transitions. [2018-12-09 00:25:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 00:25:47,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:47,692 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 00:25:47,693 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:47,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash -674729880, now seen corresponding path program 1 times [2018-12-09 00:25:47,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:25:47,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:47,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:47,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:47,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:25:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:47,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:47,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:25:47,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:25:47,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:25:47,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:25:47,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:25:47,724 INFO L87 Difference]: Start difference. First operand 178277 states and 791364 transitions. Second operand 3 states. [2018-12-09 00:25:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:49,091 INFO L93 Difference]: Finished difference Result 231657 states and 1011133 transitions. [2018-12-09 00:25:49,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:25:49,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-09 00:25:49,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:49,702 INFO L225 Difference]: With dead ends: 231657 [2018-12-09 00:25:49,702 INFO L226 Difference]: Without dead ends: 231657 [2018-12-09 00:25:49,702 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 00:25:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231657 states. [2018-12-09 00:25:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231657 to 202942. [2018-12-09 00:25:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202942 states. [2018-12-09 00:25:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202942 states to 202942 states and 893421 transitions. [2018-12-09 00:25:56,443 INFO L78 Accepts]: Start accepts. Automaton has 202942 states and 893421 transitions. Word has length 59 [2018-12-09 00:25:56,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:56,443 INFO L480 AbstractCegarLoop]: Abstraction has 202942 states and 893421 transitions. [2018-12-09 00:25:56,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:25:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 202942 states and 893421 transitions. [2018-12-09 00:25:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 00:25:56,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:56,479 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 00:25:56,479 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:56,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:56,479 INFO L82 PathProgramCache]: Analyzing trace with hash 978550790, now seen corresponding path program 1 times [2018-12-09 00:25:56,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:25:56,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:56,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:56,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:56,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:25:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:56,554 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 00:25:56,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:56,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:25:56,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:25:56,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:25:56,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:25:56,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:25:56,556 INFO L87 Difference]: Start difference. First operand 202942 states and 893421 transitions. Second operand 6 states. [2018-12-09 00:25:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:58,437 INFO L93 Difference]: Finished difference Result 278037 states and 1213527 transitions. [2018-12-09 00:25:58,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:25:58,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-09 00:25:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:59,183 INFO L225 Difference]: With dead ends: 278037 [2018-12-09 00:25:59,183 INFO L226 Difference]: Without dead ends: 273332 [2018-12-09 00:25:59,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:26:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273332 states. [2018-12-09 00:26:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273332 to 256762. [2018-12-09 00:26:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256762 states. [2018-12-09 00:26:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256762 states to 256762 states and 1124197 transitions. [2018-12-09 00:26:04,967 INFO L78 Accepts]: Start accepts. Automaton has 256762 states and 1124197 transitions. Word has length 63 [2018-12-09 00:26:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:04,967 INFO L480 AbstractCegarLoop]: Abstraction has 256762 states and 1124197 transitions. [2018-12-09 00:26:04,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:26:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 256762 states and 1124197 transitions. [2018-12-09 00:26:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 00:26:05,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:05,008 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 00:26:05,008 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:05,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:05,009 INFO L82 PathProgramCache]: Analyzing trace with hash -818400569, now seen corresponding path program 1 times [2018-12-09 00:26:05,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:05,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:05,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:05,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:05,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:05,089 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 00:26:05,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:05,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:26:05,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:05,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:26:05,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:26:05,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:26:05,090 INFO L87 Difference]: Start difference. First operand 256762 states and 1124197 transitions. Second operand 7 states. [2018-12-09 00:26:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:09,484 INFO L93 Difference]: Finished difference Result 367257 states and 1557913 transitions. [2018-12-09 00:26:09,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:26:09,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-12-09 00:26:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:10,707 INFO L225 Difference]: With dead ends: 367257 [2018-12-09 00:26:10,708 INFO L226 Difference]: Without dead ends: 367257 [2018-12-09 00:26:10,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:26:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367257 states. [2018-12-09 00:26:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367257 to 302982. [2018-12-09 00:26:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302982 states. [2018-12-09 00:26:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302982 states to 302982 states and 1302893 transitions. [2018-12-09 00:26:17,508 INFO L78 Accepts]: Start accepts. Automaton has 302982 states and 1302893 transitions. Word has length 63 [2018-12-09 00:26:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:17,508 INFO L480 AbstractCegarLoop]: Abstraction has 302982 states and 1302893 transitions. [2018-12-09 00:26:17,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:26:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 302982 states and 1302893 transitions. [2018-12-09 00:26:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 00:26:17,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:17,552 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 00:26:17,553 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:17,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:17,553 INFO L82 PathProgramCache]: Analyzing trace with hash 69103112, now seen corresponding path program 1 times [2018-12-09 00:26:17,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:17,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:17,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:17,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:17,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:17,604 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 00:26:17,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:17,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:26:17,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:17,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:26:17,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:26:17,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:26:17,606 INFO L87 Difference]: Start difference. First operand 302982 states and 1302893 transitions. Second operand 4 states. [2018-12-09 00:26:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:18,846 INFO L93 Difference]: Finished difference Result 261613 states and 1104583 transitions. [2018-12-09 00:26:18,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:26:18,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 00:26:18,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:20,139 INFO L225 Difference]: With dead ends: 261613 [2018-12-09 00:26:20,140 INFO L226 Difference]: Without dead ends: 254858 [2018-12-09 00:26:20,140 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 00:26:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254858 states. [2018-12-09 00:26:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254858 to 254858. [2018-12-09 00:26:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254858 states. [2018-12-09 00:26:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254858 states to 254858 states and 1081014 transitions. [2018-12-09 00:26:28,852 INFO L78 Accepts]: Start accepts. Automaton has 254858 states and 1081014 transitions. Word has length 63 [2018-12-09 00:26:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:28,852 INFO L480 AbstractCegarLoop]: Abstraction has 254858 states and 1081014 transitions. [2018-12-09 00:26:28,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:26:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 254858 states and 1081014 transitions. [2018-12-09 00:26:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 00:26:28,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:28,879 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 00:26:28,879 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:28,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2071932979, now seen corresponding path program 1 times [2018-12-09 00:26:28,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:28,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:28,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:28,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:28,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:28,923 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 00:26:28,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:28,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:26:28,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:28,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:26:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:26:28,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:26:28,924 INFO L87 Difference]: Start difference. First operand 254858 states and 1081014 transitions. Second operand 6 states. [2018-12-09 00:26:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:31,328 INFO L93 Difference]: Finished difference Result 407574 states and 1714377 transitions. [2018-12-09 00:26:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 00:26:31,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-09 00:26:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:32,874 INFO L225 Difference]: With dead ends: 407574 [2018-12-09 00:26:32,874 INFO L226 Difference]: Without dead ends: 400393 [2018-12-09 00:26:32,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:26:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400393 states. [2018-12-09 00:26:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400393 to 259070. [2018-12-09 00:26:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259070 states. [2018-12-09 00:26:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259070 states to 259070 states and 1099301 transitions. [2018-12-09 00:26:39,295 INFO L78 Accepts]: Start accepts. Automaton has 259070 states and 1099301 transitions. Word has length 63 [2018-12-09 00:26:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:39,295 INFO L480 AbstractCegarLoop]: Abstraction has 259070 states and 1099301 transitions. [2018-12-09 00:26:39,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:26:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 259070 states and 1099301 transitions. [2018-12-09 00:26:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 00:26:39,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:39,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:26:39,333 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:39,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:39,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1391724770, now seen corresponding path program 1 times [2018-12-09 00:26:39,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:39,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:39,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:39,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:39,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:26:39,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:39,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:26:39,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:39,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:26:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:26:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:26:39,361 INFO L87 Difference]: Start difference. First operand 259070 states and 1099301 transitions. Second operand 5 states. [2018-12-09 00:26:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:39,598 INFO L93 Difference]: Finished difference Result 57902 states and 224525 transitions. [2018-12-09 00:26:39,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:26:39,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-12-09 00:26:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:39,698 INFO L225 Difference]: With dead ends: 57902 [2018-12-09 00:26:39,698 INFO L226 Difference]: Without dead ends: 50986 [2018-12-09 00:26:39,699 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 00:26:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50986 states. [2018-12-09 00:26:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50986 to 50746. [2018-12-09 00:26:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50746 states. [2018-12-09 00:26:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50746 states to 50746 states and 196312 transitions. [2018-12-09 00:26:40,422 INFO L78 Accepts]: Start accepts. Automaton has 50746 states and 196312 transitions. Word has length 64 [2018-12-09 00:26:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:40,423 INFO L480 AbstractCegarLoop]: Abstraction has 50746 states and 196312 transitions. [2018-12-09 00:26:40,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:26:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 50746 states and 196312 transitions. [2018-12-09 00:26:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 00:26:40,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:40,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:26:40,439 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:40,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:40,440 INFO L82 PathProgramCache]: Analyzing trace with hash -276513334, now seen corresponding path program 1 times [2018-12-09 00:26:40,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:40,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:40,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:40,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:40,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:40,484 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 00:26:40,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:40,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:26:40,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:40,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:26:40,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:26:40,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:26:40,485 INFO L87 Difference]: Start difference. First operand 50746 states and 196312 transitions. Second operand 4 states. [2018-12-09 00:26:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:40,778 INFO L93 Difference]: Finished difference Result 59865 states and 230931 transitions. [2018-12-09 00:26:40,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:26:40,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-09 00:26:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:40,891 INFO L225 Difference]: With dead ends: 59865 [2018-12-09 00:26:40,891 INFO L226 Difference]: Without dead ends: 59865 [2018-12-09 00:26:40,892 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 00:26:41,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59865 states. [2018-12-09 00:26:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59865 to 53961. [2018-12-09 00:26:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53961 states. [2018-12-09 00:26:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53961 states to 53961 states and 208379 transitions. [2018-12-09 00:26:42,798 INFO L78 Accepts]: Start accepts. Automaton has 53961 states and 208379 transitions. Word has length 74 [2018-12-09 00:26:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:42,798 INFO L480 AbstractCegarLoop]: Abstraction has 53961 states and 208379 transitions. [2018-12-09 00:26:42,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:26:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 53961 states and 208379 transitions. [2018-12-09 00:26:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 00:26:42,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:42,816 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 00:26:42,816 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:42,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:42,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1466297001, now seen corresponding path program 1 times [2018-12-09 00:26:42,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:42,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:42,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:42,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:42,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:42,883 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 00:26:42,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:42,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:26:42,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:42,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:26:42,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:26:42,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:26:42,885 INFO L87 Difference]: Start difference. First operand 53961 states and 208379 transitions. Second operand 6 states. [2018-12-09 00:26:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:43,526 INFO L93 Difference]: Finished difference Result 98120 states and 377173 transitions. [2018-12-09 00:26:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 00:26:43,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-09 00:26:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:43,714 INFO L225 Difference]: With dead ends: 98120 [2018-12-09 00:26:43,714 INFO L226 Difference]: Without dead ends: 97800 [2018-12-09 00:26:43,715 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 00:26:43,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97800 states. [2018-12-09 00:26:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97800 to 58186. [2018-12-09 00:26:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58186 states. [2018-12-09 00:26:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58186 states to 58186 states and 223570 transitions. [2018-12-09 00:26:44,924 INFO L78 Accepts]: Start accepts. Automaton has 58186 states and 223570 transitions. Word has length 74 [2018-12-09 00:26:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:44,924 INFO L480 AbstractCegarLoop]: Abstraction has 58186 states and 223570 transitions. [2018-12-09 00:26:44,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:26:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 58186 states and 223570 transitions. [2018-12-09 00:26:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 00:26:44,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:44,949 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 00:26:44,949 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:44,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:44,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1987377366, now seen corresponding path program 1 times [2018-12-09 00:26:44,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:44,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:44,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:44,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:44,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:44,989 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 00:26:44,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:44,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:26:44,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:44,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:26:44,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:26:44,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:26:44,990 INFO L87 Difference]: Start difference. First operand 58186 states and 223570 transitions. Second operand 4 states. [2018-12-09 00:26:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:45,328 INFO L93 Difference]: Finished difference Result 73349 states and 278574 transitions. [2018-12-09 00:26:45,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:26:45,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-09 00:26:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:45,457 INFO L225 Difference]: With dead ends: 73349 [2018-12-09 00:26:45,457 INFO L226 Difference]: Without dead ends: 73349 [2018-12-09 00:26:45,457 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 00:26:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73349 states. [2018-12-09 00:26:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73349 to 66713. [2018-12-09 00:26:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66713 states. [2018-12-09 00:26:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66713 states to 66713 states and 254002 transitions. [2018-12-09 00:26:46,613 INFO L78 Accepts]: Start accepts. Automaton has 66713 states and 254002 transitions. Word has length 76 [2018-12-09 00:26:46,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:46,613 INFO L480 AbstractCegarLoop]: Abstraction has 66713 states and 254002 transitions. [2018-12-09 00:26:46,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:26:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 66713 states and 254002 transitions. [2018-12-09 00:26:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 00:26:46,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:46,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:26:46,646 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:46,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:46,646 INFO L82 PathProgramCache]: Analyzing trace with hash -89831977, now seen corresponding path program 1 times [2018-12-09 00:26:46,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:46,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:46,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:46,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:46,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:46,674 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 00:26:46,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:46,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:26:46,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:46,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:26:46,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:26:46,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:26:46,675 INFO L87 Difference]: Start difference. First operand 66713 states and 254002 transitions. Second operand 3 states. [2018-12-09 00:26:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:47,013 INFO L93 Difference]: Finished difference Result 69475 states and 263647 transitions. [2018-12-09 00:26:47,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:26:47,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-09 00:26:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:47,146 INFO L225 Difference]: With dead ends: 69475 [2018-12-09 00:26:47,146 INFO L226 Difference]: Without dead ends: 69475 [2018-12-09 00:26:47,147 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 00:26:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69475 states. [2018-12-09 00:26:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69475 to 68223. [2018-12-09 00:26:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68223 states. [2018-12-09 00:26:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68223 states to 68223 states and 259246 transitions. [2018-12-09 00:26:48,342 INFO L78 Accepts]: Start accepts. Automaton has 68223 states and 259246 transitions. Word has length 76 [2018-12-09 00:26:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:48,342 INFO L480 AbstractCegarLoop]: Abstraction has 68223 states and 259246 transitions. [2018-12-09 00:26:48,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:26:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 68223 states and 259246 transitions. [2018-12-09 00:26:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 00:26:48,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:48,387 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 00:26:48,387 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:48,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2086484495, now seen corresponding path program 1 times [2018-12-09 00:26:48,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:48,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:48,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:48,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:48,429 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 00:26:48,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:48,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:26:48,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:48,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:26:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:26:48,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:26:48,430 INFO L87 Difference]: Start difference. First operand 68223 states and 259246 transitions. Second operand 6 states. [2018-12-09 00:26:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:49,096 INFO L93 Difference]: Finished difference Result 82930 states and 311777 transitions. [2018-12-09 00:26:49,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:26:49,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 00:26:49,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:49,251 INFO L225 Difference]: With dead ends: 82930 [2018-12-09 00:26:49,251 INFO L226 Difference]: Without dead ends: 82930 [2018-12-09 00:26:49,251 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 00:26:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82930 states. [2018-12-09 00:26:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82930 to 78446. [2018-12-09 00:26:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78446 states. [2018-12-09 00:26:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78446 states to 78446 states and 296295 transitions. [2018-12-09 00:26:50,642 INFO L78 Accepts]: Start accepts. Automaton has 78446 states and 296295 transitions. Word has length 78 [2018-12-09 00:26:50,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:50,642 INFO L480 AbstractCegarLoop]: Abstraction has 78446 states and 296295 transitions. [2018-12-09 00:26:50,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:26:50,642 INFO L276 IsEmpty]: Start isEmpty. Operand 78446 states and 296295 transitions. [2018-12-09 00:26:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 00:26:50,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:50,689 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 00:26:50,689 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:50,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:50,689 INFO L82 PathProgramCache]: Analyzing trace with hash 9275152, now seen corresponding path program 1 times [2018-12-09 00:26:50,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:50,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:50,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:50,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:50,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:50,743 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 00:26:50,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:50,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:26:50,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:50,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:26:50,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:26:50,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:26:50,744 INFO L87 Difference]: Start difference. First operand 78446 states and 296295 transitions. Second operand 6 states. [2018-12-09 00:26:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:51,279 INFO L93 Difference]: Finished difference Result 91980 states and 338638 transitions. [2018-12-09 00:26:51,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:26:51,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 00:26:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:51,449 INFO L225 Difference]: With dead ends: 91980 [2018-12-09 00:26:51,449 INFO L226 Difference]: Without dead ends: 91980 [2018-12-09 00:26:51,450 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 00:26:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91980 states. [2018-12-09 00:26:52,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91980 to 80035. [2018-12-09 00:26:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80035 states. [2018-12-09 00:26:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80035 states to 80035 states and 297460 transitions. [2018-12-09 00:26:52,903 INFO L78 Accepts]: Start accepts. Automaton has 80035 states and 297460 transitions. Word has length 78 [2018-12-09 00:26:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:52,903 INFO L480 AbstractCegarLoop]: Abstraction has 80035 states and 297460 transitions. [2018-12-09 00:26:52,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:26:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 80035 states and 297460 transitions. [2018-12-09 00:26:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 00:26:52,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:52,949 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 00:26:52,950 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:52,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:52,950 INFO L82 PathProgramCache]: Analyzing trace with hash 220626065, now seen corresponding path program 1 times [2018-12-09 00:26:52,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:52,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:52,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:52,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:52,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:52,992 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 00:26:52,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:52,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:26:52,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:52,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:26:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:26:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:26:52,994 INFO L87 Difference]: Start difference. First operand 80035 states and 297460 transitions. Second operand 5 states. [2018-12-09 00:26:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:53,487 INFO L93 Difference]: Finished difference Result 101344 states and 374908 transitions. [2018-12-09 00:26:53,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:26:53,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-09 00:26:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:53,684 INFO L225 Difference]: With dead ends: 101344 [2018-12-09 00:26:53,684 INFO L226 Difference]: Without dead ends: 101344 [2018-12-09 00:26:53,684 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 00:26:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101344 states. [2018-12-09 00:26:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101344 to 85990. [2018-12-09 00:26:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85990 states. [2018-12-09 00:26:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85990 states to 85990 states and 317478 transitions. [2018-12-09 00:26:55,217 INFO L78 Accepts]: Start accepts. Automaton has 85990 states and 317478 transitions. Word has length 78 [2018-12-09 00:26:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:55,217 INFO L480 AbstractCegarLoop]: Abstraction has 85990 states and 317478 transitions. [2018-12-09 00:26:55,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:26:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 85990 states and 317478 transitions. [2018-12-09 00:26:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 00:26:55,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:55,267 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 00:26:55,267 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:55,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash -289908112, now seen corresponding path program 1 times [2018-12-09 00:26:55,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:55,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:55,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:26:55,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:55,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:26:55,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:55,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:26:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:26:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:26:55,302 INFO L87 Difference]: Start difference. First operand 85990 states and 317478 transitions. Second operand 5 states. [2018-12-09 00:26:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:55,944 INFO L93 Difference]: Finished difference Result 115113 states and 423726 transitions. [2018-12-09 00:26:55,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:26:55,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-09 00:26:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:56,171 INFO L225 Difference]: With dead ends: 115113 [2018-12-09 00:26:56,171 INFO L226 Difference]: Without dead ends: 115113 [2018-12-09 00:26:56,171 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 00:26:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115113 states. [2018-12-09 00:26:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115113 to 90923. [2018-12-09 00:26:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90923 states. [2018-12-09 00:26:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90923 states to 90923 states and 335672 transitions. [2018-12-09 00:26:57,774 INFO L78 Accepts]: Start accepts. Automaton has 90923 states and 335672 transitions. Word has length 78 [2018-12-09 00:26:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:26:57,774 INFO L480 AbstractCegarLoop]: Abstraction has 90923 states and 335672 transitions. [2018-12-09 00:26:57,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:26:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 90923 states and 335672 transitions. [2018-12-09 00:26:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 00:26:57,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:26:57,827 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 00:26:57,827 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:26:57,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:26:57,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2097362575, now seen corresponding path program 1 times [2018-12-09 00:26:57,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:26:57,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:57,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:26:57,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:26:57,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:26:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:26:57,862 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 00:26:57,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:26:57,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:26:57,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:26:57,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:26:57,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:26:57,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:26:57,863 INFO L87 Difference]: Start difference. First operand 90923 states and 335672 transitions. Second operand 4 states. [2018-12-09 00:26:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:26:58,579 INFO L93 Difference]: Finished difference Result 119675 states and 442976 transitions. [2018-12-09 00:26:58,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:26:58,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 00:26:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:26:58,814 INFO L225 Difference]: With dead ends: 119675 [2018-12-09 00:26:58,815 INFO L226 Difference]: Without dead ends: 117963 [2018-12-09 00:26:58,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:26:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117963 states. [2018-12-09 00:27:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117963 to 109079. [2018-12-09 00:27:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109079 states. [2018-12-09 00:27:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109079 states to 109079 states and 404024 transitions. [2018-12-09 00:27:00,635 INFO L78 Accepts]: Start accepts. Automaton has 109079 states and 404024 transitions. Word has length 78 [2018-12-09 00:27:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:00,636 INFO L480 AbstractCegarLoop]: Abstraction has 109079 states and 404024 transitions. [2018-12-09 00:27:00,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:27:00,636 INFO L276 IsEmpty]: Start isEmpty. Operand 109079 states and 404024 transitions. [2018-12-09 00:27:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 00:27:00,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:00,701 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 00:27:00,701 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:00,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:00,702 INFO L82 PathProgramCache]: Analyzing trace with hash 400653362, now seen corresponding path program 1 times [2018-12-09 00:27:00,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:00,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:00,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:00,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:00,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:00,739 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 00:27:00,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:00,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:27:00,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:00,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:27:00,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:27:00,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:27:00,740 INFO L87 Difference]: Start difference. First operand 109079 states and 404024 transitions. Second operand 6 states. [2018-12-09 00:27:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:00,857 INFO L93 Difference]: Finished difference Result 32935 states and 104464 transitions. [2018-12-09 00:27:00,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:27:00,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 00:27:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:00,892 INFO L225 Difference]: With dead ends: 32935 [2018-12-09 00:27:00,892 INFO L226 Difference]: Without dead ends: 26736 [2018-12-09 00:27:00,892 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 00:27:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26736 states. [2018-12-09 00:27:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26736 to 23366. [2018-12-09 00:27:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23366 states. [2018-12-09 00:27:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23366 states to 23366 states and 73363 transitions. [2018-12-09 00:27:01,154 INFO L78 Accepts]: Start accepts. Automaton has 23366 states and 73363 transitions. Word has length 78 [2018-12-09 00:27:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:01,154 INFO L480 AbstractCegarLoop]: Abstraction has 23366 states and 73363 transitions. [2018-12-09 00:27:01,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:27:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 23366 states and 73363 transitions. [2018-12-09 00:27:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:27:01,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:01,175 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 00:27:01,175 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:01,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:01,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2022569740, now seen corresponding path program 1 times [2018-12-09 00:27:01,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:01,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:01,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:01,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:01,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:01,221 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 00:27:01,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:01,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:27:01,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:01,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:27:01,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:27:01,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:27:01,222 INFO L87 Difference]: Start difference. First operand 23366 states and 73363 transitions. Second operand 5 states. [2018-12-09 00:27:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:01,466 INFO L93 Difference]: Finished difference Result 27330 states and 84965 transitions. [2018-12-09 00:27:01,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:27:01,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 00:27:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:01,495 INFO L225 Difference]: With dead ends: 27330 [2018-12-09 00:27:01,495 INFO L226 Difference]: Without dead ends: 27160 [2018-12-09 00:27:01,495 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 00:27:01,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27160 states. [2018-12-09 00:27:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27160 to 24156. [2018-12-09 00:27:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24156 states. [2018-12-09 00:27:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24156 states to 24156 states and 75555 transitions. [2018-12-09 00:27:01,757 INFO L78 Accepts]: Start accepts. Automaton has 24156 states and 75555 transitions. Word has length 93 [2018-12-09 00:27:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:01,758 INFO L480 AbstractCegarLoop]: Abstraction has 24156 states and 75555 transitions. [2018-12-09 00:27:01,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:27:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 24156 states and 75555 transitions. [2018-12-09 00:27:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:27:01,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:01,778 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 00:27:01,778 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:01,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash 279372632, now seen corresponding path program 2 times [2018-12-09 00:27:01,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:01,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:01,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:01,822 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 00:27:01,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:01,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:27:01,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:01,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:27:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:27:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:27:01,823 INFO L87 Difference]: Start difference. First operand 24156 states and 75555 transitions. Second operand 6 states. [2018-12-09 00:27:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:02,015 INFO L93 Difference]: Finished difference Result 23558 states and 73327 transitions. [2018-12-09 00:27:02,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:27:02,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 00:27:02,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:02,040 INFO L225 Difference]: With dead ends: 23558 [2018-12-09 00:27:02,040 INFO L226 Difference]: Without dead ends: 23558 [2018-12-09 00:27:02,041 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 00:27:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23558 states. [2018-12-09 00:27:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23558 to 20856. [2018-12-09 00:27:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20856 states. [2018-12-09 00:27:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20856 states to 20856 states and 64705 transitions. [2018-12-09 00:27:02,264 INFO L78 Accepts]: Start accepts. Automaton has 20856 states and 64705 transitions. Word has length 93 [2018-12-09 00:27:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:02,264 INFO L480 AbstractCegarLoop]: Abstraction has 20856 states and 64705 transitions. [2018-12-09 00:27:02,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:27:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 20856 states and 64705 transitions. [2018-12-09 00:27:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:27:02,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:02,282 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 00:27:02,283 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:02,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:02,283 INFO L82 PathProgramCache]: Analyzing trace with hash 757086651, now seen corresponding path program 1 times [2018-12-09 00:27:02,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:02,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:02,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:02,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:02,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:02,353 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 00:27:02,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:02,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:27:02,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:02,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:27:02,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:27:02,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:27:02,354 INFO L87 Difference]: Start difference. First operand 20856 states and 64705 transitions. Second operand 6 states. [2018-12-09 00:27:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:02,451 INFO L93 Difference]: Finished difference Result 19832 states and 60673 transitions. [2018-12-09 00:27:02,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:27:02,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 00:27:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:02,471 INFO L225 Difference]: With dead ends: 19832 [2018-12-09 00:27:02,471 INFO L226 Difference]: Without dead ends: 19832 [2018-12-09 00:27:02,471 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 00:27:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19832 states. [2018-12-09 00:27:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19832 to 12643. [2018-12-09 00:27:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12643 states. [2018-12-09 00:27:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12643 states to 12643 states and 38855 transitions. [2018-12-09 00:27:02,638 INFO L78 Accepts]: Start accepts. Automaton has 12643 states and 38855 transitions. Word has length 93 [2018-12-09 00:27:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:02,639 INFO L480 AbstractCegarLoop]: Abstraction has 12643 states and 38855 transitions. [2018-12-09 00:27:02,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:27:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12643 states and 38855 transitions. [2018-12-09 00:27:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:27:02,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:02,651 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 00:27:02,651 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:02,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:02,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1737823134, now seen corresponding path program 1 times [2018-12-09 00:27:02,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:02,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:02,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:02,712 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 00:27:02,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:02,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:27:02,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:02,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:27:02,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:27:02,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:27:02,713 INFO L87 Difference]: Start difference. First operand 12643 states and 38855 transitions. Second operand 7 states. [2018-12-09 00:27:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:02,909 INFO L93 Difference]: Finished difference Result 14994 states and 45866 transitions. [2018-12-09 00:27:02,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:27:02,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 00:27:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:02,925 INFO L225 Difference]: With dead ends: 14994 [2018-12-09 00:27:02,925 INFO L226 Difference]: Without dead ends: 14894 [2018-12-09 00:27:02,925 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 00:27:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14894 states. [2018-12-09 00:27:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14894 to 12678. [2018-12-09 00:27:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12678 states. [2018-12-09 00:27:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12678 states to 12678 states and 38953 transitions. [2018-12-09 00:27:03,056 INFO L78 Accepts]: Start accepts. Automaton has 12678 states and 38953 transitions. Word has length 95 [2018-12-09 00:27:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:03,056 INFO L480 AbstractCegarLoop]: Abstraction has 12678 states and 38953 transitions. [2018-12-09 00:27:03,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:27:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 12678 states and 38953 transitions. [2018-12-09 00:27:03,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:27:03,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:03,068 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 00:27:03,068 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:03,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash -339386209, now seen corresponding path program 1 times [2018-12-09 00:27:03,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:03,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:03,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:03,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:03,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:03,134 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 00:27:03,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:03,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:27:03,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:03,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:27:03,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:27:03,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:27:03,135 INFO L87 Difference]: Start difference. First operand 12678 states and 38953 transitions. Second operand 7 states. [2018-12-09 00:27:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:03,304 INFO L93 Difference]: Finished difference Result 14785 states and 45416 transitions. [2018-12-09 00:27:03,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:27:03,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 00:27:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:03,319 INFO L225 Difference]: With dead ends: 14785 [2018-12-09 00:27:03,319 INFO L226 Difference]: Without dead ends: 14785 [2018-12-09 00:27:03,319 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 00:27:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14785 states. [2018-12-09 00:27:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14785 to 14721. [2018-12-09 00:27:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14721 states. [2018-12-09 00:27:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14721 states to 14721 states and 45208 transitions. [2018-12-09 00:27:03,461 INFO L78 Accepts]: Start accepts. Automaton has 14721 states and 45208 transitions. Word has length 95 [2018-12-09 00:27:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:03,462 INFO L480 AbstractCegarLoop]: Abstraction has 14721 states and 45208 transitions. [2018-12-09 00:27:03,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:27:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 14721 states and 45208 transitions. [2018-12-09 00:27:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:27:03,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:03,473 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 00:27:03,473 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:03,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash 548117472, now seen corresponding path program 1 times [2018-12-09 00:27:03,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:03,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:03,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:03,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:03,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:03,552 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 00:27:03,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:03,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 00:27:03,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:03,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:27:03,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:27:03,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:27:03,553 INFO L87 Difference]: Start difference. First operand 14721 states and 45208 transitions. Second operand 10 states. [2018-12-09 00:27:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:04,277 INFO L93 Difference]: Finished difference Result 26297 states and 81005 transitions. [2018-12-09 00:27:04,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 00:27:04,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-12-09 00:27:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:04,293 INFO L225 Difference]: With dead ends: 26297 [2018-12-09 00:27:04,293 INFO L226 Difference]: Without dead ends: 16466 [2018-12-09 00:27:04,293 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 00:27:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16466 states. [2018-12-09 00:27:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16466 to 14281. [2018-12-09 00:27:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14281 states. [2018-12-09 00:27:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14281 states to 14281 states and 43341 transitions. [2018-12-09 00:27:04,433 INFO L78 Accepts]: Start accepts. Automaton has 14281 states and 43341 transitions. Word has length 95 [2018-12-09 00:27:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:04,433 INFO L480 AbstractCegarLoop]: Abstraction has 14281 states and 43341 transitions. [2018-12-09 00:27:04,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:27:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 14281 states and 43341 transitions. [2018-12-09 00:27:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:27:04,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:04,444 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 00:27:04,444 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:04,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:04,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1346988258, now seen corresponding path program 2 times [2018-12-09 00:27:04,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:04,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:04,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:04,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:04,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:04,526 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 00:27:04,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:04,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 00:27:04,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:04,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:27:04,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:27:04,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:27:04,527 INFO L87 Difference]: Start difference. First operand 14281 states and 43341 transitions. Second operand 10 states. [2018-12-09 00:27:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:04,967 INFO L93 Difference]: Finished difference Result 25629 states and 77408 transitions. [2018-12-09 00:27:04,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:27:04,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-12-09 00:27:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:04,979 INFO L225 Difference]: With dead ends: 25629 [2018-12-09 00:27:04,979 INFO L226 Difference]: Without dead ends: 12077 [2018-12-09 00:27:04,979 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 00:27:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12077 states. [2018-12-09 00:27:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12077 to 12077. [2018-12-09 00:27:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12077 states. [2018-12-09 00:27:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12077 states to 12077 states and 36273 transitions. [2018-12-09 00:27:05,088 INFO L78 Accepts]: Start accepts. Automaton has 12077 states and 36273 transitions. Word has length 95 [2018-12-09 00:27:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:05,088 INFO L480 AbstractCegarLoop]: Abstraction has 12077 states and 36273 transitions. [2018-12-09 00:27:05,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:27:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 12077 states and 36273 transitions. [2018-12-09 00:27:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:27:05,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:05,099 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 00:27:05,099 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:05,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:05,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1462199036, now seen corresponding path program 3 times [2018-12-09 00:27:05,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:05,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:05,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:05,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:05,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:05,148 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 00:27:05,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:05,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:27:05,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:05,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:27:05,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:27:05,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:27:05,148 INFO L87 Difference]: Start difference. First operand 12077 states and 36273 transitions. Second operand 7 states. [2018-12-09 00:27:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:05,416 INFO L93 Difference]: Finished difference Result 20802 states and 62747 transitions. [2018-12-09 00:27:05,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:27:05,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 00:27:05,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:05,424 INFO L225 Difference]: With dead ends: 20802 [2018-12-09 00:27:05,424 INFO L226 Difference]: Without dead ends: 8744 [2018-12-09 00:27:05,425 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 00:27:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8744 states. [2018-12-09 00:27:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8744 to 8744. [2018-12-09 00:27:05,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8744 states. [2018-12-09 00:27:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8744 states to 8744 states and 26557 transitions. [2018-12-09 00:27:05,502 INFO L78 Accepts]: Start accepts. Automaton has 8744 states and 26557 transitions. Word has length 95 [2018-12-09 00:27:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:05,502 INFO L480 AbstractCegarLoop]: Abstraction has 8744 states and 26557 transitions. [2018-12-09 00:27:05,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:27:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 8744 states and 26557 transitions. [2018-12-09 00:27:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:27:05,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:05,510 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 00:27:05,510 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:05,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1492546748, now seen corresponding path program 2 times [2018-12-09 00:27:05,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:05,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:05,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:05,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:05,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:05,568 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 00:27:05,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:05,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:27:05,568 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:05,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:27:05,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:27:05,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:27:05,569 INFO L87 Difference]: Start difference. First operand 8744 states and 26557 transitions. Second operand 7 states. [2018-12-09 00:27:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:05,762 INFO L93 Difference]: Finished difference Result 9394 states and 28590 transitions. [2018-12-09 00:27:05,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:27:05,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 00:27:05,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:05,771 INFO L225 Difference]: With dead ends: 9394 [2018-12-09 00:27:05,772 INFO L226 Difference]: Without dead ends: 9394 [2018-12-09 00:27:05,772 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 00:27:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9394 states. [2018-12-09 00:27:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9394 to 8634. [2018-12-09 00:27:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8634 states. [2018-12-09 00:27:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8634 states to 8634 states and 26312 transitions. [2018-12-09 00:27:05,849 INFO L78 Accepts]: Start accepts. Automaton has 8634 states and 26312 transitions. Word has length 95 [2018-12-09 00:27:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:05,850 INFO L480 AbstractCegarLoop]: Abstraction has 8634 states and 26312 transitions. [2018-12-09 00:27:05,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:27:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 8634 states and 26312 transitions. [2018-12-09 00:27:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:27:05,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:05,856 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 00:27:05,857 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:05,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:05,857 INFO L82 PathProgramCache]: Analyzing trace with hash -833560456, now seen corresponding path program 3 times [2018-12-09 00:27:05,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:05,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:05,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:05,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:05,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:05,934 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 00:27:05,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:05,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:27:05,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:05,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:27:05,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:27:05,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:27:05,935 INFO L87 Difference]: Start difference. First operand 8634 states and 26312 transitions. Second operand 7 states. [2018-12-09 00:27:06,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:06,224 INFO L93 Difference]: Finished difference Result 13334 states and 40369 transitions. [2018-12-09 00:27:06,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:27:06,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 00:27:06,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:06,238 INFO L225 Difference]: With dead ends: 13334 [2018-12-09 00:27:06,238 INFO L226 Difference]: Without dead ends: 12974 [2018-12-09 00:27:06,238 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 00:27:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12974 states. [2018-12-09 00:27:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12974 to 8858. [2018-12-09 00:27:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8858 states. [2018-12-09 00:27:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8858 states to 8858 states and 26792 transitions. [2018-12-09 00:27:06,345 INFO L78 Accepts]: Start accepts. Automaton has 8858 states and 26792 transitions. Word has length 95 [2018-12-09 00:27:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:06,345 INFO L480 AbstractCegarLoop]: Abstraction has 8858 states and 26792 transitions. [2018-12-09 00:27:06,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:27:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 8858 states and 26792 transitions. [2018-12-09 00:27:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:27:06,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:06,353 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 00:27:06,353 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:06,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:06,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1384197497, now seen corresponding path program 2 times [2018-12-09 00:27:06,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:06,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:06,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:06,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:06,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:06,443 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 00:27:06,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:06,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:27:06,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:06,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:27:06,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:27:06,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:27:06,444 INFO L87 Difference]: Start difference. First operand 8858 states and 26792 transitions. Second operand 8 states. [2018-12-09 00:27:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:06,620 INFO L93 Difference]: Finished difference Result 10230 states and 31041 transitions. [2018-12-09 00:27:06,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:27:06,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-09 00:27:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:06,629 INFO L225 Difference]: With dead ends: 10230 [2018-12-09 00:27:06,629 INFO L226 Difference]: Without dead ends: 10230 [2018-12-09 00:27:06,629 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 00:27:06,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10230 states. [2018-12-09 00:27:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10230 to 8918. [2018-12-09 00:27:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8918 states. [2018-12-09 00:27:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 27001 transitions. [2018-12-09 00:27:06,716 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 27001 transitions. Word has length 95 [2018-12-09 00:27:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:06,717 INFO L480 AbstractCegarLoop]: Abstraction has 8918 states and 27001 transitions. [2018-12-09 00:27:06,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:27:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 27001 transitions. [2018-12-09 00:27:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:27:06,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:06,724 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 00:27:06,725 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:06,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:06,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2023266118, now seen corresponding path program 4 times [2018-12-09 00:27:06,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:06,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:06,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:06,812 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 00:27:06,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:06,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 00:27:06,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:27:06,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:27:06,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:27:06,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:27:06,813 INFO L87 Difference]: Start difference. First operand 8918 states and 27001 transitions. Second operand 11 states. [2018-12-09 00:27:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:07,350 INFO L93 Difference]: Finished difference Result 17434 states and 53280 transitions. [2018-12-09 00:27:07,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 00:27:07,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-09 00:27:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:27:07,360 INFO L225 Difference]: With dead ends: 17434 [2018-12-09 00:27:07,360 INFO L226 Difference]: Without dead ends: 10428 [2018-12-09 00:27:07,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-09 00:27:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10428 states. [2018-12-09 00:27:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10428 to 8828. [2018-12-09 00:27:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8828 states. [2018-12-09 00:27:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8828 states to 8828 states and 26753 transitions. [2018-12-09 00:27:07,448 INFO L78 Accepts]: Start accepts. Automaton has 8828 states and 26753 transitions. Word has length 95 [2018-12-09 00:27:07,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:27:07,449 INFO L480 AbstractCegarLoop]: Abstraction has 8828 states and 26753 transitions. [2018-12-09 00:27:07,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:27:07,449 INFO L276 IsEmpty]: Start isEmpty. Operand 8828 states and 26753 transitions. [2018-12-09 00:27:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:27:07,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:27:07,457 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 00:27:07,457 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:27:07,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:07,458 INFO L82 PathProgramCache]: Analyzing trace with hash 452153496, now seen corresponding path program 5 times [2018-12-09 00:27:07,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:27:07,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:07,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:07,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:07,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:27:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:07,496 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 00:27:07,571 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 00:27:07,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:27:07 BasicIcfg [2018-12-09 00:27:07,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:27:07,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:27:07,573 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:27:07,573 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:27:07,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:24:59" (3/4) ... [2018-12-09 00:27:07,575 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 00:27:07,651 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_84f45434-67e9-44de-9e62-b96410695409/bin-2019/utaipan/witness.graphml [2018-12-09 00:27:07,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:27:07,652 INFO L168 Benchmark]: Toolchain (without parser) took 129323.72 ms. Allocated memory was 1.0 GB in the beginning and 7.7 GB in the end (delta: 6.6 GB). Free memory was 952.4 MB in the beginning and 5.1 GB in the end (delta: -4.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-09 00:27:07,653 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:27:07,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:27:07,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.79 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 00:27:07,653 INFO L168 Benchmark]: Boogie Preprocessor took 24.52 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 00:27:07,654 INFO L168 Benchmark]: RCFGBuilder took 360.42 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:27:07,654 INFO L168 Benchmark]: TraceAbstraction took 128428.35 ms. Allocated memory was 1.2 GB in the beginning and 7.7 GB in the end (delta: 6.5 GB). Free memory was 1.1 GB in the beginning and 5.2 GB in the end (delta: -4.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-09 00:27:07,654 INFO L168 Benchmark]: Witness Printer took 78.79 ms. Allocated memory is still 7.7 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:27:07,656 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.79 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 24.52 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. * RCFGBuilder took 360.42 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 128428.35 ms. Allocated memory was 1.2 GB in the beginning and 7.7 GB in the end (delta: 6.5 GB). Free memory was 1.1 GB in the beginning and 5.2 GB in the end (delta: -4.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 78.79 ms. Allocated memory is still 7.7 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_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 t890; 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(&t890, ((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 t891; 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(&t891, ((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 t892; 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(&t892, ((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, 128.3s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 35.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9032 SDtfs, 11556 SDslu, 22155 SDs, 0 SdLazy, 8623 SolverSat, 449 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 88 SyntacticMatches, 22 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302982occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 71.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 674784 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2589 NumberOfCodeBlocks, 2589 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2462 ConstructedInterpolants, 0 QuantifiedInterpolants, 503165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...