./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix048_power.oepc_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_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix048_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/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 a299d32759fb8b5d2ba361364e58b6f478d5063e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 23:51:14,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:51:14,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:51:14,140 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:51:14,140 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:51:14,141 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:51:14,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:51:14,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:51:14,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:51:14,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:51:14,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:51:14,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:51:14,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:51:14,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:51:14,145 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:51:14,145 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:51:14,146 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:51:14,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:51:14,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:51:14,148 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:51:14,149 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:51:14,149 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:51:14,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:51:14,150 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:51:14,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:51:14,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:51:14,151 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:51:14,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:51:14,152 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:51:14,152 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:51:14,153 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:51:14,153 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:51:14,153 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:51:14,153 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:51:14,154 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:51:14,154 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:51:14,154 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 23:51:14,161 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:51:14,161 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:51:14,162 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 23:51:14,162 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 23:51:14,162 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 23:51:14,162 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 23:51:14,162 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 23:51:14,162 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 23:51:14,162 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 23:51:14,162 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 23:51:14,162 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 23:51:14,162 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 23:51:14,162 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 23:51:14,163 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:51:14,163 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:51:14,163 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:51:14,163 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:51:14,163 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:51:14,163 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 23:51:14,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 23:51:14,163 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 23:51:14,163 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:51:14,163 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:51:14,164 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 23:51:14,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:51:14,164 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:51:14,164 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 23:51:14,164 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 23:51:14,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:51:14,164 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:51:14,164 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 23:51:14,164 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 23:51:14,164 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 23:51:14,164 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 23:51:14,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 23:51:14,165 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 23:51:14,165 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_d1457b13-341d-4f73-abc0-e79339f30ed9/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 -> a299d32759fb8b5d2ba361364e58b6f478d5063e [2018-12-02 23:51:14,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:51:14,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:51:14,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:51:14,191 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:51:14,191 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:51:14,192 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix048_power.oepc_false-unreach-call.i [2018-12-02 23:51:14,226 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/data/b0171cf47/9462ffcfdf494d389dfdd777514cc2c2/FLAGf5ae545ad [2018-12-02 23:51:14,669 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:51:14,669 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/sv-benchmarks/c/pthread-wmm/mix048_power.oepc_false-unreach-call.i [2018-12-02 23:51:14,677 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/data/b0171cf47/9462ffcfdf494d389dfdd777514cc2c2/FLAGf5ae545ad [2018-12-02 23:51:14,685 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/data/b0171cf47/9462ffcfdf494d389dfdd777514cc2c2 [2018-12-02 23:51:14,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:51:14,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:51:14,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:51:14,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:51:14,690 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:51:14,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:51:14" (1/1) ... [2018-12-02 23:51:14,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdc5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:14, skipping insertion in model container [2018-12-02 23:51:14,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:51:14" (1/1) ... [2018-12-02 23:51:14,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:51:14,719 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:51:14,899 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:51:14,907 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:51:14,986 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:51:15,017 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:51:15,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15 WrapperNode [2018-12-02 23:51:15,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:51:15,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:51:15,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:51:15,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:51:15,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15" (1/1) ... [2018-12-02 23:51:15,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15" (1/1) ... [2018-12-02 23:51:15,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:51:15,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:51:15,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:51:15,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:51:15,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15" (1/1) ... [2018-12-02 23:51:15,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15" (1/1) ... [2018-12-02 23:51:15,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15" (1/1) ... [2018-12-02 23:51:15,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15" (1/1) ... [2018-12-02 23:51:15,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15" (1/1) ... [2018-12-02 23:51:15,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15" (1/1) ... [2018-12-02 23:51:15,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15" (1/1) ... [2018-12-02 23:51:15,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:51:15,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:51:15,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:51:15,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:51:15,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:51:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 23:51:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 23:51:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 23:51:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 23:51:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 23:51:15,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 23:51:15,102 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 23:51:15,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 23:51:15,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 23:51:15,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:51:15,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:51:15,103 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 23:51:15,386 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:51:15,387 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 23:51:15,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:51:15 BoogieIcfgContainer [2018-12-02 23:51:15,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:51:15,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 23:51:15,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 23:51:15,390 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 23:51:15,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:51:14" (1/3) ... [2018-12-02 23:51:15,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c01781e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:51:15, skipping insertion in model container [2018-12-02 23:51:15,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:15" (2/3) ... [2018-12-02 23:51:15,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c01781e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:51:15, skipping insertion in model container [2018-12-02 23:51:15,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:51:15" (3/3) ... [2018-12-02 23:51:15,392 INFO L112 eAbstractionObserver]: Analyzing ICFG mix048_power.oepc_false-unreach-call.i [2018-12-02 23:51:15,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,417 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,417 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,417 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,418 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,418 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,424 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,424 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:51:15,445 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 23:51:15,446 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 23:51:15,452 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 23:51:15,463 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 23:51:15,479 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 23:51:15,479 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 23:51:15,479 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 23:51:15,479 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:51:15,479 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:51:15,479 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 23:51:15,479 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:51:15,479 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 23:51:15,488 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-02 23:51:16,949 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-02 23:51:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-02 23:51:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 23:51:16,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:16,955 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] [2018-12-02 23:51:16,957 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:16,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:16,960 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-12-02 23:51:16,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:16,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:16,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:16,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:16,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:17,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:17,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:51:17,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:17,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:51:17,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:51:17,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:51:17,106 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-02 23:51:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:17,579 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-02 23:51:17,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:51:17,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-02 23:51:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:17,748 INFO L225 Difference]: With dead ends: 60790 [2018-12-02 23:51:17,748 INFO L226 Difference]: Without dead ends: 44270 [2018-12-02 23:51:17,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:51:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-02 23:51:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-02 23:51:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-02 23:51:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-02 23:51:18,478 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-02 23:51:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:18,479 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-02 23:51:18,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:51:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-02 23:51:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 23:51:18,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:18,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:51:18,484 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:18,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-12-02 23:51:18,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:18,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:18,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:18,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:18,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:51:18,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:18,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:51:18,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:51:18,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:51:18,544 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-02 23:51:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:18,617 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-02 23:51:18,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:51:18,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 23:51:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:18,633 INFO L225 Difference]: With dead ends: 8528 [2018-12-02 23:51:18,633 INFO L226 Difference]: Without dead ends: 7466 [2018-12-02 23:51:18,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:51:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-02 23:51:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-02 23:51:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-02 23:51:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-02 23:51:18,717 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-02 23:51:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:18,718 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-02 23:51:18,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:51:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-02 23:51:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 23:51:18,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:18,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:51:18,719 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:18,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-12-02 23:51:18,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:18,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:18,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:18,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:18,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:51:18,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:18,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:51:18,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:51:18,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:51:18,777 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-02 23:51:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:19,006 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-02 23:51:19,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:51:19,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 23:51:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:19,062 INFO L225 Difference]: With dead ends: 13998 [2018-12-02 23:51:19,062 INFO L226 Difference]: Without dead ends: 13930 [2018-12-02 23:51:19,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:51:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-02 23:51:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-02 23:51:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-02 23:51:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-02 23:51:19,175 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-02 23:51:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:19,176 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-02 23:51:19,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:51:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-02 23:51:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 23:51:19,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:19,177 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-02 23:51:19,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:19,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-12-02 23:51:19,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:19,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:19,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:19,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:19,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:19,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:19,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:51:19,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:19,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:51:19,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:51:19,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:51:19,214 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-02 23:51:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:19,279 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-02 23:51:19,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:51:19,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 23:51:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:19,294 INFO L225 Difference]: With dead ends: 13279 [2018-12-02 23:51:19,295 INFO L226 Difference]: Without dead ends: 13279 [2018-12-02 23:51:19,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:51:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-02 23:51:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-02 23:51:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-02 23:51:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-02 23:51:19,414 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-02 23:51:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:19,415 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-02 23:51:19,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:51:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-02 23:51:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 23:51:19,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:19,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:51:19,416 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:19,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-12-02 23:51:19,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:19,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:19,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:19,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:19,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:19,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:19,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:51:19,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:19,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:51:19,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:51:19,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:51:19,481 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-02 23:51:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:19,878 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-02 23:51:19,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:51:19,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-02 23:51:19,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:19,891 INFO L225 Difference]: With dead ends: 12285 [2018-12-02 23:51:19,891 INFO L226 Difference]: Without dead ends: 12213 [2018-12-02 23:51:19,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-02 23:51:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-02 23:51:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-02 23:51:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-02 23:51:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-02 23:51:20,038 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-02 23:51:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:20,038 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-02 23:51:20,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:51:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-02 23:51:20,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 23:51:20,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:20,041 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] [2018-12-02 23:51:20,041 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:20,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:20,042 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-12-02 23:51:20,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:20,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:20,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:20,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:20,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:20,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:20,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:51:20,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:20,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:51:20,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:51:20,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:51:20,098 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-02 23:51:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:20,173 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-02 23:51:20,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:51:20,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-02 23:51:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:20,187 INFO L225 Difference]: With dead ends: 12396 [2018-12-02 23:51:20,187 INFO L226 Difference]: Without dead ends: 12396 [2018-12-02 23:51:20,188 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-02 23:51:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-02 23:51:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-02 23:51:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-02 23:51:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-02 23:51:20,307 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-02 23:51:20,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:20,308 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-02 23:51:20,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:51:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-02 23:51:20,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 23:51:20,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:20,311 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] [2018-12-02 23:51:20,311 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:20,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-12-02 23:51:20,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:20,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:20,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:20,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:20,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:20,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:20,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:51:20,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:20,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:51:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:51:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:51:20,352 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-02 23:51:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:20,633 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-02 23:51:20,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:51:20,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-02 23:51:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:20,657 INFO L225 Difference]: With dead ends: 20969 [2018-12-02 23:51:20,657 INFO L226 Difference]: Without dead ends: 20898 [2018-12-02 23:51:20,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:51:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-02 23:51:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-02 23:51:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-02 23:51:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-02 23:51:20,837 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-02 23:51:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:20,837 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-02 23:51:20,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:51:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-02 23:51:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 23:51:20,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:20,842 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-02 23:51:20,842 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:20,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:20,843 INFO L82 PathProgramCache]: Analyzing trace with hash 553940321, now seen corresponding path program 1 times [2018-12-02 23:51:20,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:20,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:20,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:20,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:20,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:51:20,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:20,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:51:20,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:51:20,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:51:20,889 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-02 23:51:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:21,119 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-12-02 23:51:21,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:51:21,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 23:51:21,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:21,143 INFO L225 Difference]: With dead ends: 17635 [2018-12-02 23:51:21,143 INFO L226 Difference]: Without dead ends: 17635 [2018-12-02 23:51:21,143 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-02 23:51:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-02 23:51:21,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-12-02 23:51:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-12-02 23:51:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-12-02 23:51:21,388 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-12-02 23:51:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:21,388 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-12-02 23:51:21,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:51:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-12-02 23:51:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 23:51:21,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:21,393 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-02 23:51:21,393 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:21,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:21,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1523269022, now seen corresponding path program 1 times [2018-12-02 23:51:21,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:21,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:21,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:21,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:21,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:21,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:21,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:51:21,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:21,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:51:21,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:51:21,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:51:21,418 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-12-02 23:51:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:21,567 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-12-02 23:51:21,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:51:21,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-02 23:51:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:21,585 INFO L225 Difference]: With dead ends: 16385 [2018-12-02 23:51:21,585 INFO L226 Difference]: Without dead ends: 16385 [2018-12-02 23:51:21,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:51:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-12-02 23:51:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-12-02 23:51:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-12-02 23:51:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-12-02 23:51:21,750 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-12-02 23:51:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:21,750 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-12-02 23:51:21,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:51:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-12-02 23:51:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:51:21,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:21,756 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] [2018-12-02 23:51:21,756 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:21,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash 493974152, now seen corresponding path program 1 times [2018-12-02 23:51:21,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:21,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:21,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:21,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:21,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-02 23:51:21,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:21,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:51:21,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:21,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:51:21,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:51:21,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:51:21,813 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-12-02 23:51:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:22,389 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-12-02 23:51:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:51:22,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 23:51:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:22,410 INFO L225 Difference]: With dead ends: 19821 [2018-12-02 23:51:22,411 INFO L226 Difference]: Without dead ends: 19821 [2018-12-02 23:51:22,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:51:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-12-02 23:51:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-12-02 23:51:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-12-02 23:51:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-12-02 23:51:22,606 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-12-02 23:51:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:22,606 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-12-02 23:51:22,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:51:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-12-02 23:51:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:51:22,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:22,613 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] [2018-12-02 23:51:22,613 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:22,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:22,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1583235191, now seen corresponding path program 1 times [2018-12-02 23:51:22,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:22,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:22,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:22,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:22,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:22,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:22,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:51:22,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:22,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:51:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:51:22,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:51:22,680 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-12-02 23:51:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:22,949 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-12-02 23:51:22,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:51:22,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 23:51:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:23,003 INFO L225 Difference]: With dead ends: 21449 [2018-12-02 23:51:23,003 INFO L226 Difference]: Without dead ends: 21449 [2018-12-02 23:51:23,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:51:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-12-02 23:51:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-12-02 23:51:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-12-02 23:51:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-12-02 23:51:23,186 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-12-02 23:51:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:23,186 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-12-02 23:51:23,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:51:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-12-02 23:51:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:51:23,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:23,193 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] [2018-12-02 23:51:23,193 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:23,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:23,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1371884278, now seen corresponding path program 1 times [2018-12-02 23:51:23,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:23,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:23,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:23,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:23,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:23,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:23,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:51:23,246 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:23,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:51:23,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:51:23,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:51:23,246 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-12-02 23:51:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:23,492 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-12-02 23:51:23,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:51:23,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 23:51:23,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:23,521 INFO L225 Difference]: With dead ends: 25024 [2018-12-02 23:51:23,521 INFO L226 Difference]: Without dead ends: 25024 [2018-12-02 23:51:23,521 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-02 23:51:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-12-02 23:51:23,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-12-02 23:51:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-12-02 23:51:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-12-02 23:51:23,766 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-12-02 23:51:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:23,766 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-12-02 23:51:23,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:51:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-12-02 23:51:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:51:23,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:23,774 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] [2018-12-02 23:51:23,774 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:23,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:23,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1882418455, now seen corresponding path program 1 times [2018-12-02 23:51:23,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:23,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:23,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:23,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:23,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:23,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:23,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:51:23,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:23,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:51:23,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:51:23,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:51:23,821 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 4 states. [2018-12-02 23:51:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:24,169 INFO L93 Difference]: Finished difference Result 31689 states and 95699 transitions. [2018-12-02 23:51:24,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:51:24,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 23:51:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:24,203 INFO L225 Difference]: With dead ends: 31689 [2018-12-02 23:51:24,203 INFO L226 Difference]: Without dead ends: 31537 [2018-12-02 23:51:24,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:51:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31537 states. [2018-12-02 23:51:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31537 to 28553. [2018-12-02 23:51:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28553 states. [2018-12-02 23:51:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28553 states to 28553 states and 86263 transitions. [2018-12-02 23:51:24,559 INFO L78 Accepts]: Start accepts. Automaton has 28553 states and 86263 transitions. Word has length 66 [2018-12-02 23:51:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:24,559 INFO L480 AbstractCegarLoop]: Abstraction has 28553 states and 86263 transitions. [2018-12-02 23:51:24,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:51:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 28553 states and 86263 transitions. [2018-12-02 23:51:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:51:24,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:24,569 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] [2018-12-02 23:51:24,569 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:24,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:24,570 INFO L82 PathProgramCache]: Analyzing trace with hash -74963992, now seen corresponding path program 1 times [2018-12-02 23:51:24,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:24,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:24,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:24,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:24,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:51:24,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:24,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:51:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:51:24,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:51:24,652 INFO L87 Difference]: Start difference. First operand 28553 states and 86263 transitions. Second operand 5 states. [2018-12-02 23:51:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:24,959 INFO L93 Difference]: Finished difference Result 40195 states and 119844 transitions. [2018-12-02 23:51:24,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:51:24,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 23:51:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:25,006 INFO L225 Difference]: With dead ends: 40195 [2018-12-02 23:51:25,006 INFO L226 Difference]: Without dead ends: 39987 [2018-12-02 23:51:25,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:51:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39987 states. [2018-12-02 23:51:25,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39987 to 35807. [2018-12-02 23:51:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-12-02 23:51:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-12-02 23:51:25,418 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-12-02 23:51:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:25,418 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-12-02 23:51:25,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:51:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-12-02 23:51:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:51:25,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:25,427 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] [2018-12-02 23:51:25,427 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:25,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:25,427 INFO L82 PathProgramCache]: Analyzing trace with hash 615597482, now seen corresponding path program 1 times [2018-12-02 23:51:25,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:25,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:25,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:25,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:25,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:25,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:25,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 23:51:25,497 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:25,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 23:51:25,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 23:51:25,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:51:25,497 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 9 states. [2018-12-02 23:51:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:26,139 INFO L93 Difference]: Finished difference Result 44023 states and 131291 transitions. [2018-12-02 23:51:26,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:51:26,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-12-02 23:51:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:26,190 INFO L225 Difference]: With dead ends: 44023 [2018-12-02 23:51:26,190 INFO L226 Difference]: Without dead ends: 44023 [2018-12-02 23:51:26,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:51:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44023 states. [2018-12-02 23:51:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44023 to 38973. [2018-12-02 23:51:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38973 states. [2018-12-02 23:51:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38973 states to 38973 states and 116711 transitions. [2018-12-02 23:51:26,663 INFO L78 Accepts]: Start accepts. Automaton has 38973 states and 116711 transitions. Word has length 66 [2018-12-02 23:51:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:26,663 INFO L480 AbstractCegarLoop]: Abstraction has 38973 states and 116711 transitions. [2018-12-02 23:51:26,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 23:51:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 38973 states and 116711 transitions. [2018-12-02 23:51:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:51:26,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:26,671 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] [2018-12-02 23:51:26,671 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:26,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:26,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1503101163, now seen corresponding path program 1 times [2018-12-02 23:51:26,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:26,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:26,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:26,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:26,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:26,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:26,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:51:26,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:26,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:51:26,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:51:26,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:51:26,707 INFO L87 Difference]: Start difference. First operand 38973 states and 116711 transitions. Second operand 5 states. [2018-12-02 23:51:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:26,747 INFO L93 Difference]: Finished difference Result 9637 states and 23357 transitions. [2018-12-02 23:51:26,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:51:26,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 23:51:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:26,752 INFO L225 Difference]: With dead ends: 9637 [2018-12-02 23:51:26,752 INFO L226 Difference]: Without dead ends: 7669 [2018-12-02 23:51:26,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:51:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2018-12-02 23:51:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 6276. [2018-12-02 23:51:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6276 states. [2018-12-02 23:51:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 14833 transitions. [2018-12-02 23:51:26,802 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 14833 transitions. Word has length 66 [2018-12-02 23:51:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:26,802 INFO L480 AbstractCegarLoop]: Abstraction has 6276 states and 14833 transitions. [2018-12-02 23:51:26,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:51:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 14833 transitions. [2018-12-02 23:51:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:51:26,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:26,805 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] [2018-12-02 23:51:26,805 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:26,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:26,805 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-12-02 23:51:26,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:26,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:26,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:26,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:26,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:26,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:26,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:51:26,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:26,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:51:26,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:51:26,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:51:26,835 INFO L87 Difference]: Start difference. First operand 6276 states and 14833 transitions. Second operand 3 states. [2018-12-02 23:51:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:26,861 INFO L93 Difference]: Finished difference Result 8733 states and 20570 transitions. [2018-12-02 23:51:26,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:51:26,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-02 23:51:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:26,867 INFO L225 Difference]: With dead ends: 8733 [2018-12-02 23:51:26,868 INFO L226 Difference]: Without dead ends: 8733 [2018-12-02 23:51:26,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:51:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8733 states. [2018-12-02 23:51:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8733 to 6213. [2018-12-02 23:51:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2018-12-02 23:51:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 14371 transitions. [2018-12-02 23:51:26,920 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 14371 transitions. Word has length 66 [2018-12-02 23:51:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:26,920 INFO L480 AbstractCegarLoop]: Abstraction has 6213 states and 14371 transitions. [2018-12-02 23:51:26,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:51:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 14371 transitions. [2018-12-02 23:51:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 23:51:26,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:26,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:51:26,924 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:26,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:26,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-12-02 23:51:26,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:26,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:26,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:26,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:26,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:26,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:26,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:51:26,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:26,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:51:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:51:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:51:26,961 INFO L87 Difference]: Start difference. First operand 6213 states and 14371 transitions. Second operand 5 states. [2018-12-02 23:51:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:27,051 INFO L93 Difference]: Finished difference Result 7383 states and 17012 transitions. [2018-12-02 23:51:27,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:51:27,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-02 23:51:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:27,055 INFO L225 Difference]: With dead ends: 7383 [2018-12-02 23:51:27,056 INFO L226 Difference]: Without dead ends: 7383 [2018-12-02 23:51:27,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:51:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2018-12-02 23:51:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6657. [2018-12-02 23:51:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6657 states. [2018-12-02 23:51:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 15375 transitions. [2018-12-02 23:51:27,102 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 15375 transitions. Word has length 72 [2018-12-02 23:51:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:27,103 INFO L480 AbstractCegarLoop]: Abstraction has 6657 states and 15375 transitions. [2018-12-02 23:51:27,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:51:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 15375 transitions. [2018-12-02 23:51:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 23:51:27,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:27,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:51:27,106 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:27,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-12-02 23:51:27,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:27,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:27,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:27,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:27,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 23:51:27,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:27,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 23:51:27,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 23:51:27,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:51:27,199 INFO L87 Difference]: Start difference. First operand 6657 states and 15375 transitions. Second operand 9 states. [2018-12-02 23:51:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:27,622 INFO L93 Difference]: Finished difference Result 8851 states and 20272 transitions. [2018-12-02 23:51:27,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 23:51:27,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-02 23:51:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:27,629 INFO L225 Difference]: With dead ends: 8851 [2018-12-02 23:51:27,629 INFO L226 Difference]: Without dead ends: 8732 [2018-12-02 23:51:27,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-02 23:51:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8732 states. [2018-12-02 23:51:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8732 to 6746. [2018-12-02 23:51:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6746 states. [2018-12-02 23:51:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 15444 transitions. [2018-12-02 23:51:27,685 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 15444 transitions. Word has length 72 [2018-12-02 23:51:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:27,685 INFO L480 AbstractCegarLoop]: Abstraction has 6746 states and 15444 transitions. [2018-12-02 23:51:27,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 23:51:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 15444 transitions. [2018-12-02 23:51:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:51:27,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:51:27,690 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:27,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1199180902, now seen corresponding path program 1 times [2018-12-02 23:51:27,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:27,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:27,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:27,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:27,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:27,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:27,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:51:27,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:27,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:51:27,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:51:27,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:51:27,712 INFO L87 Difference]: Start difference. First operand 6746 states and 15444 transitions. Second operand 3 states. [2018-12-02 23:51:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:27,817 INFO L93 Difference]: Finished difference Result 8422 states and 18970 transitions. [2018-12-02 23:51:27,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:51:27,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-02 23:51:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:27,822 INFO L225 Difference]: With dead ends: 8422 [2018-12-02 23:51:27,822 INFO L226 Difference]: Without dead ends: 8422 [2018-12-02 23:51:27,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:51:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2018-12-02 23:51:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 7857. [2018-12-02 23:51:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-12-02 23:51:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 17760 transitions. [2018-12-02 23:51:27,881 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 17760 transitions. Word has length 91 [2018-12-02 23:51:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:27,881 INFO L480 AbstractCegarLoop]: Abstraction has 7857 states and 17760 transitions. [2018-12-02 23:51:27,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:51:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 17760 transitions. [2018-12-02 23:51:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:51:27,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:27,886 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] [2018-12-02 23:51:27,887 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:27,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash 496143053, now seen corresponding path program 1 times [2018-12-02 23:51:27,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:27,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:27,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:27,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:27,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:27,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:27,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:51:27,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:27,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:51:27,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:51:27,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:51:27,913 INFO L87 Difference]: Start difference. First operand 7857 states and 17760 transitions. Second operand 4 states. [2018-12-02 23:51:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:27,993 INFO L93 Difference]: Finished difference Result 8431 states and 19074 transitions. [2018-12-02 23:51:27,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:51:27,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 23:51:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:28,000 INFO L225 Difference]: With dead ends: 8431 [2018-12-02 23:51:28,001 INFO L226 Difference]: Without dead ends: 8431 [2018-12-02 23:51:28,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:51:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2018-12-02 23:51:28,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 7772. [2018-12-02 23:51:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7772 states. [2018-12-02 23:51:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7772 states to 7772 states and 17676 transitions. [2018-12-02 23:51:28,085 INFO L78 Accepts]: Start accepts. Automaton has 7772 states and 17676 transitions. Word has length 91 [2018-12-02 23:51:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:28,085 INFO L480 AbstractCegarLoop]: Abstraction has 7772 states and 17676 transitions. [2018-12-02 23:51:28,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:51:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7772 states and 17676 transitions. [2018-12-02 23:51:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:51:28,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:28,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:51:28,091 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:28,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:28,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2034999584, now seen corresponding path program 1 times [2018-12-02 23:51:28,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:28,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:28,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:28,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:28,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:28,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:28,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:51:28,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:28,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:51:28,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:51:28,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:51:28,129 INFO L87 Difference]: Start difference. First operand 7772 states and 17676 transitions. Second operand 5 states. [2018-12-02 23:51:28,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:28,214 INFO L93 Difference]: Finished difference Result 8948 states and 20243 transitions. [2018-12-02 23:51:28,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:51:28,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 23:51:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:28,220 INFO L225 Difference]: With dead ends: 8948 [2018-12-02 23:51:28,220 INFO L226 Difference]: Without dead ends: 8948 [2018-12-02 23:51:28,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:51:28,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8948 states. [2018-12-02 23:51:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8948 to 6902. [2018-12-02 23:51:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6902 states. [2018-12-02 23:51:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 15741 transitions. [2018-12-02 23:51:28,274 INFO L78 Accepts]: Start accepts. Automaton has 6902 states and 15741 transitions. Word has length 93 [2018-12-02 23:51:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:28,274 INFO L480 AbstractCegarLoop]: Abstraction has 6902 states and 15741 transitions. [2018-12-02 23:51:28,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:51:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6902 states and 15741 transitions. [2018-12-02 23:51:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:51:28,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:28,279 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-02 23:51:28,280 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:28,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:28,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2005231167, now seen corresponding path program 1 times [2018-12-02 23:51:28,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:28,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:28,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:28,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:28,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:28,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:28,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:51:28,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:28,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:51:28,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:51:28,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:51:28,309 INFO L87 Difference]: Start difference. First operand 6902 states and 15741 transitions. Second operand 5 states. [2018-12-02 23:51:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:28,578 INFO L93 Difference]: Finished difference Result 11458 states and 26340 transitions. [2018-12-02 23:51:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:51:28,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 23:51:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:28,585 INFO L225 Difference]: With dead ends: 11458 [2018-12-02 23:51:28,585 INFO L226 Difference]: Without dead ends: 11380 [2018-12-02 23:51:28,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:51:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2018-12-02 23:51:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 8056. [2018-12-02 23:51:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2018-12-02 23:51:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 18403 transitions. [2018-12-02 23:51:28,662 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 18403 transitions. Word has length 93 [2018-12-02 23:51:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:28,662 INFO L480 AbstractCegarLoop]: Abstraction has 8056 states and 18403 transitions. [2018-12-02 23:51:28,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:51:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 18403 transitions. [2018-12-02 23:51:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:51:28,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:28,668 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-02 23:51:28,668 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:28,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1044971648, now seen corresponding path program 1 times [2018-12-02 23:51:28,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:28,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:28,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:28,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-02 23:51:28,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:28,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:51:28,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:28,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:51:28,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:51:28,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:51:28,724 INFO L87 Difference]: Start difference. First operand 8056 states and 18403 transitions. Second operand 6 states. [2018-12-02 23:51:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:28,931 INFO L93 Difference]: Finished difference Result 10204 states and 23157 transitions. [2018-12-02 23:51:28,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:51:28,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 23:51:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:28,938 INFO L225 Difference]: With dead ends: 10204 [2018-12-02 23:51:28,938 INFO L226 Difference]: Without dead ends: 10125 [2018-12-02 23:51:28,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:51:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10125 states. [2018-12-02 23:51:29,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10125 to 7529. [2018-12-02 23:51:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2018-12-02 23:51:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 17293 transitions. [2018-12-02 23:51:29,011 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 17293 transitions. Word has length 93 [2018-12-02 23:51:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:29,012 INFO L480 AbstractCegarLoop]: Abstraction has 7529 states and 17293 transitions. [2018-12-02 23:51:29,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:51:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 17293 transitions. [2018-12-02 23:51:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:51:29,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:29,017 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-02 23:51:29,017 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:29,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:29,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1661415981, now seen corresponding path program 1 times [2018-12-02 23:51:29,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:29,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:29,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:29,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:29,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:29,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:29,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 23:51:29,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:29,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 23:51:29,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 23:51:29,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:51:29,102 INFO L87 Difference]: Start difference. First operand 7529 states and 17293 transitions. Second operand 9 states. [2018-12-02 23:51:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:29,423 INFO L93 Difference]: Finished difference Result 10604 states and 24259 transitions. [2018-12-02 23:51:29,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 23:51:29,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-02 23:51:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:29,429 INFO L225 Difference]: With dead ends: 10604 [2018-12-02 23:51:29,430 INFO L226 Difference]: Without dead ends: 10572 [2018-12-02 23:51:29,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-02 23:51:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10572 states. [2018-12-02 23:51:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10572 to 9100. [2018-12-02 23:51:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9100 states. [2018-12-02 23:51:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9100 states to 9100 states and 20773 transitions. [2018-12-02 23:51:29,503 INFO L78 Accepts]: Start accepts. Automaton has 9100 states and 20773 transitions. Word has length 93 [2018-12-02 23:51:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:29,503 INFO L480 AbstractCegarLoop]: Abstraction has 9100 states and 20773 transitions. [2018-12-02 23:51:29,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 23:51:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 9100 states and 20773 transitions. [2018-12-02 23:51:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:51:29,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:29,509 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-02 23:51:29,510 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:29,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:29,510 INFO L82 PathProgramCache]: Analyzing trace with hash 836599956, now seen corresponding path program 1 times [2018-12-02 23:51:29,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:29,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:29,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:29,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:29,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:29,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:29,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 23:51:29,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:29,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 23:51:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:51:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:51:29,581 INFO L87 Difference]: Start difference. First operand 9100 states and 20773 transitions. Second operand 8 states. [2018-12-02 23:51:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:29,823 INFO L93 Difference]: Finished difference Result 14198 states and 32836 transitions. [2018-12-02 23:51:29,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:51:29,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-02 23:51:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:29,832 INFO L225 Difference]: With dead ends: 14198 [2018-12-02 23:51:29,832 INFO L226 Difference]: Without dead ends: 14198 [2018-12-02 23:51:29,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 23:51:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14198 states. [2018-12-02 23:51:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14198 to 9690. [2018-12-02 23:51:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9690 states. [2018-12-02 23:51:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9690 states to 9690 states and 22304 transitions. [2018-12-02 23:51:29,919 INFO L78 Accepts]: Start accepts. Automaton has 9690 states and 22304 transitions. Word has length 93 [2018-12-02 23:51:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:29,919 INFO L480 AbstractCegarLoop]: Abstraction has 9690 states and 22304 transitions. [2018-12-02 23:51:29,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 23:51:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 9690 states and 22304 transitions. [2018-12-02 23:51:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:51:29,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:29,925 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-02 23:51:29,925 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:29,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:29,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1724103637, now seen corresponding path program 1 times [2018-12-02 23:51:29,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:29,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:29,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:29,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:29,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:29,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:29,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:51:29,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:29,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:51:29,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:51:29,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:51:29,989 INFO L87 Difference]: Start difference. First operand 9690 states and 22304 transitions. Second operand 7 states. [2018-12-02 23:51:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:30,089 INFO L93 Difference]: Finished difference Result 13553 states and 31411 transitions. [2018-12-02 23:51:30,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:51:30,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 23:51:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:30,098 INFO L225 Difference]: With dead ends: 13553 [2018-12-02 23:51:30,098 INFO L226 Difference]: Without dead ends: 13553 [2018-12-02 23:51:30,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:51:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13553 states. [2018-12-02 23:51:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13553 to 9782. [2018-12-02 23:51:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9782 states. [2018-12-02 23:51:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9782 states to 9782 states and 22252 transitions. [2018-12-02 23:51:30,179 INFO L78 Accepts]: Start accepts. Automaton has 9782 states and 22252 transitions. Word has length 93 [2018-12-02 23:51:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:30,179 INFO L480 AbstractCegarLoop]: Abstraction has 9782 states and 22252 transitions. [2018-12-02 23:51:30,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:51:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 9782 states and 22252 transitions. [2018-12-02 23:51:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:51:30,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:30,185 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-02 23:51:30,185 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:30,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash -7871915, now seen corresponding path program 1 times [2018-12-02 23:51:30,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:30,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:30,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:30,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:30,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:51:30,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:30,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:51:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:51:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:51:30,230 INFO L87 Difference]: Start difference. First operand 9782 states and 22252 transitions. Second operand 6 states. [2018-12-02 23:51:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:30,298 INFO L93 Difference]: Finished difference Result 9302 states and 20796 transitions. [2018-12-02 23:51:30,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:51:30,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 23:51:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:30,304 INFO L225 Difference]: With dead ends: 9302 [2018-12-02 23:51:30,304 INFO L226 Difference]: Without dead ends: 9302 [2018-12-02 23:51:30,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:51:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9302 states. [2018-12-02 23:51:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9302 to 5735. [2018-12-02 23:51:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5735 states. [2018-12-02 23:51:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 12856 transitions. [2018-12-02 23:51:30,357 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 12856 transitions. Word has length 93 [2018-12-02 23:51:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:30,358 INFO L480 AbstractCegarLoop]: Abstraction has 5735 states and 12856 transitions. [2018-12-02 23:51:30,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:51:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 12856 transitions. [2018-12-02 23:51:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:51:30,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:30,361 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-02 23:51:30,361 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:30,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:30,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1803035193, now seen corresponding path program 1 times [2018-12-02 23:51:30,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:30,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:30,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:30,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:30,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:30,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:30,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:51:30,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:30,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:51:30,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:51:30,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:51:30,424 INFO L87 Difference]: Start difference. First operand 5735 states and 12856 transitions. Second operand 5 states. [2018-12-02 23:51:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:30,448 INFO L93 Difference]: Finished difference Result 5735 states and 12840 transitions. [2018-12-02 23:51:30,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:51:30,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-02 23:51:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:30,452 INFO L225 Difference]: With dead ends: 5735 [2018-12-02 23:51:30,452 INFO L226 Difference]: Without dead ends: 5735 [2018-12-02 23:51:30,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:51:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2018-12-02 23:51:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 5735. [2018-12-02 23:51:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5735 states. [2018-12-02 23:51:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 12840 transitions. [2018-12-02 23:51:30,487 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 12840 transitions. Word has length 95 [2018-12-02 23:51:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:30,488 INFO L480 AbstractCegarLoop]: Abstraction has 5735 states and 12840 transitions. [2018-12-02 23:51:30,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:51:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 12840 transitions. [2018-12-02 23:51:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:51:30,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:30,491 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-02 23:51:30,491 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:30,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash -915531512, now seen corresponding path program 1 times [2018-12-02 23:51:30,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:30,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:30,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:30,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:30,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:30,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:30,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 23:51:30,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:30,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 23:51:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 23:51:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:51:30,581 INFO L87 Difference]: Start difference. First operand 5735 states and 12840 transitions. Second operand 11 states. [2018-12-02 23:51:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:31,337 INFO L93 Difference]: Finished difference Result 10915 states and 24583 transitions. [2018-12-02 23:51:31,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 23:51:31,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 23:51:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:31,342 INFO L225 Difference]: With dead ends: 10915 [2018-12-02 23:51:31,342 INFO L226 Difference]: Without dead ends: 7559 [2018-12-02 23:51:31,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 23:51:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2018-12-02 23:51:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 5599. [2018-12-02 23:51:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5599 states. [2018-12-02 23:51:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5599 states to 5599 states and 12459 transitions. [2018-12-02 23:51:31,384 INFO L78 Accepts]: Start accepts. Automaton has 5599 states and 12459 transitions. Word has length 95 [2018-12-02 23:51:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:31,385 INFO L480 AbstractCegarLoop]: Abstraction has 5599 states and 12459 transitions. [2018-12-02 23:51:31,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 23:51:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5599 states and 12459 transitions. [2018-12-02 23:51:31,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:51:31,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:31,388 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-02 23:51:31,388 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:31,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:31,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2034339057, now seen corresponding path program 1 times [2018-12-02 23:51:31,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:31,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:31,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:31,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:31,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:51:31,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:31,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:51:31,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:51:31,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:51:31,457 INFO L87 Difference]: Start difference. First operand 5599 states and 12459 transitions. Second operand 6 states. [2018-12-02 23:51:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:31,542 INFO L93 Difference]: Finished difference Result 6357 states and 13981 transitions. [2018-12-02 23:51:31,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:51:31,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 23:51:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:31,546 INFO L225 Difference]: With dead ends: 6357 [2018-12-02 23:51:31,546 INFO L226 Difference]: Without dead ends: 6327 [2018-12-02 23:51:31,546 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-02 23:51:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6327 states. [2018-12-02 23:51:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6327 to 5471. [2018-12-02 23:51:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2018-12-02 23:51:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 12082 transitions. [2018-12-02 23:51:31,589 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 12082 transitions. Word has length 95 [2018-12-02 23:51:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:31,589 INFO L480 AbstractCegarLoop]: Abstraction has 5471 states and 12082 transitions. [2018-12-02 23:51:31,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:51:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 12082 transitions. [2018-12-02 23:51:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:51:31,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:31,593 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-02 23:51:31,593 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:31,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:31,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1697868305, now seen corresponding path program 2 times [2018-12-02 23:51:31,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:31,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:31,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:51:31,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:31,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:51:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:51:31,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:51:31,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:51:31,660 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:51:31,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:51:31,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:51:31,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:51:31,660 INFO L87 Difference]: Start difference. First operand 5471 states and 12082 transitions. Second operand 6 states. [2018-12-02 23:51:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:51:31,774 INFO L93 Difference]: Finished difference Result 5893 states and 12934 transitions. [2018-12-02 23:51:31,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:51:31,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 23:51:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:51:31,777 INFO L225 Difference]: With dead ends: 5893 [2018-12-02 23:51:31,777 INFO L226 Difference]: Without dead ends: 5893 [2018-12-02 23:51:31,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:51:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2018-12-02 23:51:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 5467. [2018-12-02 23:51:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5467 states. [2018-12-02 23:51:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5467 states to 5467 states and 12050 transitions. [2018-12-02 23:51:31,819 INFO L78 Accepts]: Start accepts. Automaton has 5467 states and 12050 transitions. Word has length 95 [2018-12-02 23:51:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:51:31,820 INFO L480 AbstractCegarLoop]: Abstraction has 5467 states and 12050 transitions. [2018-12-02 23:51:31,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:51:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5467 states and 12050 transitions. [2018-12-02 23:51:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:51:31,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:51:31,824 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-02 23:51:31,824 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:51:31,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:51:31,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1930862478, now seen corresponding path program 2 times [2018-12-02 23:51:31,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:51:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:31,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:51:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:51:31,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:51:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:51:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:51:31,860 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 23:51:31,927 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 23:51:31,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:51:31 BasicIcfg [2018-12-02 23:51:31,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 23:51:31,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:51:31,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:51:31,928 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:51:31,929 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:51:15" (3/4) ... [2018-12-02 23:51:31,930 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 23:51:32,003 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d1457b13-341d-4f73-abc0-e79339f30ed9/bin-2019/utaipan/witness.graphml [2018-12-02 23:51:32,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:51:32,004 INFO L168 Benchmark]: Toolchain (without parser) took 17317.05 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 951.7 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 256.6 MB. Max. memory is 11.5 GB. [2018-12-02 23:51:32,005 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:51:32,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2018-12-02 23:51:32,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.86 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 23:51:32,005 INFO L168 Benchmark]: Boogie Preprocessor took 20.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:51:32,006 INFO L168 Benchmark]: RCFGBuilder took 318.22 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-12-02 23:51:32,006 INFO L168 Benchmark]: TraceAbstraction took 16539.94 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 196.6 MB. Max. memory is 11.5 GB. [2018-12-02 23:51:32,006 INFO L168 Benchmark]: Witness Printer took 75.41 ms. Allocated memory is still 2.7 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2018-12-02 23:51:32,007 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.86 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 318.22 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16539.94 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 196.6 MB. Max. memory is 11.5 GB. * Witness Printer took 75.41 ms. Allocated memory is still 2.7 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1283; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1283, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L772] -1 pthread_t t1284; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t1284, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 16.4s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8476 SDtfs, 9119 SDslu, 20169 SDs, 0 SdLazy, 8901 SolverSat, 419 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 85 SyntacticMatches, 31 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38973occurred in iteration=15, 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: 4.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 86931 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2452 NumberOfCodeBlocks, 2452 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2325 ConstructedInterpolants, 0 QuantifiedInterpolants, 508692 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...