./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/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 892c70f1fefdd41ce6be6b69b919a1c90f237180 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:26:03,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:26:03,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:26:03,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:26:03,305 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:26:03,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:26:03,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:26:03,307 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:26:03,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:26:03,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:26:03,309 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:26:03,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:26:03,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:26:03,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:26:03,310 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:26:03,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:26:03,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:26:03,312 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:26:03,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:26:03,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:26:03,314 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:26:03,315 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:26:03,316 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:26:03,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:26:03,316 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:26:03,317 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:26:03,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:26:03,318 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:26:03,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:26:03,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:26:03,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:26:03,319 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:26:03,319 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:26:03,319 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:26:03,320 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:26:03,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:26:03,320 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 23:26:03,328 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:26:03,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:26:03,328 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 23:26:03,328 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 23:26:03,328 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 23:26:03,328 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 23:26:03,329 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 23:26:03,329 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 23:26:03,329 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 23:26:03,329 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 23:26:03,329 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 23:26:03,329 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 23:26:03,329 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 23:26:03,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:26:03,330 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:26:03,330 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:26:03,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:26:03,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:26:03,330 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 23:26:03,330 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 23:26:03,330 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 23:26:03,330 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:26:03,330 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:26:03,330 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 23:26:03,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:26:03,330 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:26:03,331 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 23:26:03,331 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 23:26:03,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:26:03,331 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:26:03,331 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 23:26:03,331 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 23:26:03,331 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 23:26:03,331 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 23:26:03,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 23:26:03,331 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 23:26:03,331 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_db0c2a2f-9395-41de-8856-1d25d6a50970/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 -> 892c70f1fefdd41ce6be6b69b919a1c90f237180 [2018-12-02 23:26:03,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:26:03,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:26:03,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:26:03,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:26:03,363 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:26:03,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix022_rmo.opt_false-unreach-call.i [2018-12-02 23:26:03,408 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/bin-2019/utaipan/data/8a096bf80/c25712a80d8d4af0a21d2705035f4f96/FLAGfa04fe90a [2018-12-02 23:26:03,868 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:26:03,868 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/sv-benchmarks/c/pthread-wmm/mix022_rmo.opt_false-unreach-call.i [2018-12-02 23:26:03,876 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/bin-2019/utaipan/data/8a096bf80/c25712a80d8d4af0a21d2705035f4f96/FLAGfa04fe90a [2018-12-02 23:26:04,382 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/bin-2019/utaipan/data/8a096bf80/c25712a80d8d4af0a21d2705035f4f96 [2018-12-02 23:26:04,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:26:04,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:26:04,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:26:04,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:26:04,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:26:04,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:26:04" (1/1) ... [2018-12-02 23:26:04,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ef13e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:26:04, skipping insertion in model container [2018-12-02 23:26:04,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:26:04" (1/1) ... [2018-12-02 23:26:04,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:26:04,417 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:26:04,593 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:26:04,601 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:26:04,679 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:26:04,710 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:26:04,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:26:04 WrapperNode [2018-12-02 23:26:04,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:26:04,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:26:04,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:26:04,711 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:26:04,716 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:26:04" (1/1) ... [2018-12-02 23:26:04,726 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:26:04" (1/1) ... [2018-12-02 23:26:04,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:26:04,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:26:04,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:26:04,741 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:26:04,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:26:04" (1/1) ... [2018-12-02 23:26:04,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:26:04" (1/1) ... [2018-12-02 23:26:04,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:26:04" (1/1) ... [2018-12-02 23:26:04,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:26:04" (1/1) ... [2018-12-02 23:26:04,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:26:04" (1/1) ... [2018-12-02 23:26:04,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:26:04" (1/1) ... [2018-12-02 23:26:04,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:26:04" (1/1) ... [2018-12-02 23:26:04,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:26:04,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:26:04,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:26:04,762 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:26:04,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:26:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/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:26:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 23:26:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 23:26:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 23:26:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 23:26:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 23:26:04,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 23:26:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 23:26:04,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 23:26:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 23:26:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:26:04,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:26:04,796 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:26:05,096 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:26:05,096 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 23:26:05,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:26:05 BoogieIcfgContainer [2018-12-02 23:26:05,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:26:05,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 23:26:05,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 23:26:05,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 23:26:05,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:26:04" (1/3) ... [2018-12-02 23:26:05,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f78ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:26:05, skipping insertion in model container [2018-12-02 23:26:05,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:26:04" (2/3) ... [2018-12-02 23:26:05,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f78ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:26:05, skipping insertion in model container [2018-12-02 23:26:05,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:26:05" (3/3) ... [2018-12-02 23:26:05,101 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_rmo.opt_false-unreach-call.i [2018-12-02 23:26:05,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,125 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,125 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,125 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,125 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:26:05,125 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,126 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,130 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,130 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:26:05,144 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 23:26:05,144 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 23:26:05,149 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 23:26:05,159 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 23:26:05,175 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 23:26:05,175 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 23:26:05,175 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 23:26:05,175 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:26:05,175 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:26:05,175 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 23:26:05,175 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:26:05,175 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 23:26:05,182 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-02 23:26:06,780 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-02 23:26:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-02 23:26:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 23:26:06,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:06,787 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:26:06,789 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:06,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:06,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2100747441, now seen corresponding path program 1 times [2018-12-02 23:26:06,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:06,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:06,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:06,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:06,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:06,933 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:26:06,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:06,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:26:06,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:06,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:26:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:26:06,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:26:06,949 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-02 23:26:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:07,413 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-02 23:26:07,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:26:07,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-02 23:26:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:07,570 INFO L225 Difference]: With dead ends: 60790 [2018-12-02 23:26:07,570 INFO L226 Difference]: Without dead ends: 44270 [2018-12-02 23:26:07,571 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:26:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-02 23:26:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-02 23:26:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-02 23:26:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-02 23:26:08,341 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-02 23:26:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:08,341 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-02 23:26:08,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:26:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-02 23:26:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 23:26:08,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:08,346 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:26:08,346 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:08,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1664977985, now seen corresponding path program 1 times [2018-12-02 23:26:08,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:08,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:08,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:08,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:08,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:08,397 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:26:08,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:08,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:26:08,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:08,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:26:08,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:26:08,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:26:08,399 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-02 23:26:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:08,496 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-02 23:26:08,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:26:08,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 23:26:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:08,517 INFO L225 Difference]: With dead ends: 8528 [2018-12-02 23:26:08,518 INFO L226 Difference]: Without dead ends: 7466 [2018-12-02 23:26:08,518 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:26:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-02 23:26:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-02 23:26:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-02 23:26:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-02 23:26:08,625 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-02 23:26:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:08,625 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-02 23:26:08,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:26:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-02 23:26:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 23:26:08,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:08,626 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:26:08,627 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:08,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:08,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1909915460, now seen corresponding path program 1 times [2018-12-02 23:26:08,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:08,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:08,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:08,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:08,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:08,702 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:26:08,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:08,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:26:08,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:08,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:26:08,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:26:08,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:26:08,704 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-02 23:26:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:08,925 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-02 23:26:08,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:26:08,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 23:26:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:08,949 INFO L225 Difference]: With dead ends: 13998 [2018-12-02 23:26:08,949 INFO L226 Difference]: Without dead ends: 13930 [2018-12-02 23:26:08,950 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:26:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-02 23:26:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-02 23:26:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-02 23:26:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-02 23:26:09,212 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-02 23:26:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:09,213 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-02 23:26:09,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:26:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-02 23:26:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 23:26:09,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:09,214 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:26:09,215 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:09,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1845061814, now seen corresponding path program 1 times [2018-12-02 23:26:09,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:09,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:09,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:09,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:09,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:09,238 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:26:09,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:09,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:26:09,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:09,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:26:09,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:26:09,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:26:09,239 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-02 23:26:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:09,304 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-02 23:26:09,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:26:09,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 23:26:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:09,320 INFO L225 Difference]: With dead ends: 13279 [2018-12-02 23:26:09,320 INFO L226 Difference]: Without dead ends: 13279 [2018-12-02 23:26:09,320 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:26:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-02 23:26:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-02 23:26:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-02 23:26:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-02 23:26:09,442 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-02 23:26:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:09,442 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-02 23:26:09,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:26:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-02 23:26:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 23:26:09,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:09,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:26:09,444 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:09,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:09,444 INFO L82 PathProgramCache]: Analyzing trace with hash 484350805, now seen corresponding path program 1 times [2018-12-02 23:26:09,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:09,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:09,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:09,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:09,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:09,499 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:26:09,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:09,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:26:09,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:09,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:26:09,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:26:09,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:26:09,500 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-02 23:26:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:09,850 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-02 23:26:09,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:26:09,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-02 23:26:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:09,863 INFO L225 Difference]: With dead ends: 12285 [2018-12-02 23:26:09,863 INFO L226 Difference]: Without dead ends: 12213 [2018-12-02 23:26:09,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 23:26:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-02 23:26:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-02 23:26:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-02 23:26:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-02 23:26:09,980 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-02 23:26:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:09,980 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-02 23:26:09,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:26:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-02 23:26:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 23:26:09,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:09,983 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:26:09,983 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:09,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:09,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1383304625, now seen corresponding path program 1 times [2018-12-02 23:26:09,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:09,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:09,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:09,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:09,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:10,023 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:26:10,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:10,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:26:10,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:10,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:26:10,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:26:10,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:26:10,024 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-02 23:26:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:10,097 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-02 23:26:10,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:26:10,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-02 23:26:10,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:10,111 INFO L225 Difference]: With dead ends: 12396 [2018-12-02 23:26:10,111 INFO L226 Difference]: Without dead ends: 12396 [2018-12-02 23:26:10,111 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:26:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-02 23:26:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-02 23:26:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-02 23:26:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-02 23:26:10,251 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-02 23:26:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:10,251 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-02 23:26:10,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:26:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-02 23:26:10,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 23:26:10,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:10,255 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:26:10,255 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:10,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:10,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1168852336, now seen corresponding path program 1 times [2018-12-02 23:26:10,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:10,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:10,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:10,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:10,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:10,315 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:26:10,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:10,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:26:10,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:10,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:26:10,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:26:10,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:26:10,316 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-02 23:26:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:10,630 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-02 23:26:10,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:26:10,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-02 23:26:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:10,724 INFO L225 Difference]: With dead ends: 20969 [2018-12-02 23:26:10,724 INFO L226 Difference]: Without dead ends: 20898 [2018-12-02 23:26:10,724 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:26:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-02 23:26:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-02 23:26:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-02 23:26:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-02 23:26:10,889 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-02 23:26:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:10,889 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-02 23:26:10,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:26:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-02 23:26:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 23:26:10,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:10,893 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:26:10,894 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:10,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:10,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1208126989, now seen corresponding path program 1 times [2018-12-02 23:26:10,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:10,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:10,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:10,925 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:26:10,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:10,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:26:10,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:10,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:26:10,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:26:10,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:26:10,926 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-02 23:26:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:11,152 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2018-12-02 23:26:11,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:26:11,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 23:26:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:11,179 INFO L225 Difference]: With dead ends: 23352 [2018-12-02 23:26:11,179 INFO L226 Difference]: Without dead ends: 23352 [2018-12-02 23:26:11,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:26:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2018-12-02 23:26:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2018-12-02 23:26:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2018-12-02 23:26:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2018-12-02 23:26:11,369 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2018-12-02 23:26:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:11,369 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2018-12-02 23:26:11,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:26:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2018-12-02 23:26:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 23:26:11,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:11,373 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:26:11,373 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:11,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash -914723982, now seen corresponding path program 1 times [2018-12-02 23:26:11,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:11,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:11,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:11,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:11,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:11,410 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:26:11,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:11,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:26:11,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:11,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:26:11,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:26:11,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:26:11,411 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2018-12-02 23:26:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:11,622 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2018-12-02 23:26:11,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:26:11,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 23:26:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:11,642 INFO L225 Difference]: With dead ends: 18411 [2018-12-02 23:26:11,642 INFO L226 Difference]: Without dead ends: 18411 [2018-12-02 23:26:11,642 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:26:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2018-12-02 23:26:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2018-12-02 23:26:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2018-12-02 23:26:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2018-12-02 23:26:11,821 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2018-12-02 23:26:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:11,821 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2018-12-02 23:26:11,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:26:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2018-12-02 23:26:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 23:26:11,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:11,826 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:26:11,826 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:11,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash 126242611, now seen corresponding path program 1 times [2018-12-02 23:26:11,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:11,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:11,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:11,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:11,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:11,940 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:26:11,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:11,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:26:11,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:11,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:26:11,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:26:11,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:26:11,941 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2018-12-02 23:26:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:12,079 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2018-12-02 23:26:12,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:26:12,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-02 23:26:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:12,097 INFO L225 Difference]: With dead ends: 17193 [2018-12-02 23:26:12,097 INFO L226 Difference]: Without dead ends: 17193 [2018-12-02 23:26:12,098 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:26:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2018-12-02 23:26:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2018-12-02 23:26:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2018-12-02 23:26:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2018-12-02 23:26:12,266 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2018-12-02 23:26:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:12,267 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2018-12-02 23:26:12,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:26:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2018-12-02 23:26:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:26:12,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:12,272 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:26:12,272 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:12,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash -859455011, now seen corresponding path program 1 times [2018-12-02 23:26:12,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:12,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:12,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:12,328 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:26:12,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:12,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:26:12,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:12,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:26:12,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:26:12,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:26:12,329 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2018-12-02 23:26:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:12,958 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2018-12-02 23:26:12,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:26:12,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 23:26:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:12,979 INFO L225 Difference]: With dead ends: 20789 [2018-12-02 23:26:12,979 INFO L226 Difference]: Without dead ends: 20789 [2018-12-02 23:26:12,979 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:26:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2018-12-02 23:26:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2018-12-02 23:26:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2018-12-02 23:26:13,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2018-12-02 23:26:13,182 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2018-12-02 23:26:13,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:13,182 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2018-12-02 23:26:13,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:26:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2018-12-02 23:26:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:26:13,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:13,189 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:26:13,189 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:13,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash 102159006, now seen corresponding path program 1 times [2018-12-02 23:26:13,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:13,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:13,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:13,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:13,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:26:13,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:13,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:26:13,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:13,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:26:13,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:26:13,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:26:13,257 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2018-12-02 23:26:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:13,548 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2018-12-02 23:26:13,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:26:13,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 23:26:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:13,570 INFO L225 Difference]: With dead ends: 22441 [2018-12-02 23:26:13,570 INFO L226 Difference]: Without dead ends: 22441 [2018-12-02 23:26:13,570 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:26:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2018-12-02 23:26:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2018-12-02 23:26:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2018-12-02 23:26:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2018-12-02 23:26:13,794 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2018-12-02 23:26:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:13,794 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2018-12-02 23:26:13,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:26:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2018-12-02 23:26:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:26:13,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:13,801 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:26:13,801 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:13,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1346923487, now seen corresponding path program 1 times [2018-12-02 23:26:13,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:13,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:13,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:13,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:13,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:13,848 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:26:13,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:13,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:26:13,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:13,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:26:13,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:26:13,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:26:13,849 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2018-12-02 23:26:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:14,069 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2018-12-02 23:26:14,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:26:14,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 23:26:14,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:14,102 INFO L225 Difference]: With dead ends: 26432 [2018-12-02 23:26:14,102 INFO L226 Difference]: Without dead ends: 26432 [2018-12-02 23:26:14,102 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:26:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2018-12-02 23:26:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2018-12-02 23:26:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2018-12-02 23:26:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2018-12-02 23:26:14,445 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2018-12-02 23:26:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:14,445 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2018-12-02 23:26:14,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:26:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2018-12-02 23:26:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:26:14,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:14,453 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:26:14,453 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:14,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash 836389310, now seen corresponding path program 1 times [2018-12-02 23:26:14,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:14,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:14,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:14,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:14,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:26:14,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:14,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:26:14,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:14,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:26:14,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:26:14,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:26:14,506 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2018-12-02 23:26:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:14,806 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2018-12-02 23:26:14,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:26:14,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 23:26:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:14,842 INFO L225 Difference]: With dead ends: 33063 [2018-12-02 23:26:14,843 INFO L226 Difference]: Without dead ends: 33063 [2018-12-02 23:26:14,843 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:26:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2018-12-02 23:26:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2018-12-02 23:26:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2018-12-02 23:26:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2018-12-02 23:26:15,186 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2018-12-02 23:26:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:15,186 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2018-12-02 23:26:15,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:26:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2018-12-02 23:26:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:26:15,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:15,194 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:26:15,194 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:15,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash -971065153, now seen corresponding path program 1 times [2018-12-02 23:26:15,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:15,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:15,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:15,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:15,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:15,233 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:26:15,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:15,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:26:15,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:15,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:26:15,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:26:15,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:26:15,234 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 4 states. [2018-12-02 23:26:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:15,586 INFO L93 Difference]: Finished difference Result 38903 states and 116585 transitions. [2018-12-02 23:26:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:26:15,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 23:26:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:15,627 INFO L225 Difference]: With dead ends: 38903 [2018-12-02 23:26:15,627 INFO L226 Difference]: Without dead ends: 38671 [2018-12-02 23:26:15,627 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:26:15,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38671 states. [2018-12-02 23:26:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38671 to 35807. [2018-12-02 23:26:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-12-02 23:26:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-12-02 23:26:16,018 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-12-02 23:26:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:16,018 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-12-02 23:26:16,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:26:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-12-02 23:26:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:26:16,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:16,027 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:26:16,027 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:16,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1526950784, now seen corresponding path program 1 times [2018-12-02 23:26:16,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:16,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:16,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:16,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:16,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:16,059 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:26:16,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:16,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:26:16,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:16,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:26:16,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:26:16,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:26:16,060 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 5 states. [2018-12-02 23:26:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:16,091 INFO L93 Difference]: Finished difference Result 9315 states and 22546 transitions. [2018-12-02 23:26:16,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:26:16,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 23:26:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:16,096 INFO L225 Difference]: With dead ends: 9315 [2018-12-02 23:26:16,096 INFO L226 Difference]: Without dead ends: 7463 [2018-12-02 23:26:16,096 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:26:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2018-12-02 23:26:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 6360. [2018-12-02 23:26:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6360 states. [2018-12-02 23:26:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6360 states to 6360 states and 15017 transitions. [2018-12-02 23:26:16,180 INFO L78 Accepts]: Start accepts. Automaton has 6360 states and 15017 transitions. Word has length 66 [2018-12-02 23:26:16,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:16,180 INFO L480 AbstractCegarLoop]: Abstraction has 6360 states and 15017 transitions. [2018-12-02 23:26:16,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:26:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6360 states and 15017 transitions. [2018-12-02 23:26:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:26:16,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:16,184 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:26:16,184 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:16,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:16,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1184013087, now seen corresponding path program 1 times [2018-12-02 23:26:16,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:16,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:16,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:16,199 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:26:16,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:16,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:26:16,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:16,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:26:16,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:26:16,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:26:16,199 INFO L87 Difference]: Start difference. First operand 6360 states and 15017 transitions. Second operand 3 states. [2018-12-02 23:26:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:16,229 INFO L93 Difference]: Finished difference Result 8819 states and 20756 transitions. [2018-12-02 23:26:16,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:26:16,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-02 23:26:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:16,234 INFO L225 Difference]: With dead ends: 8819 [2018-12-02 23:26:16,235 INFO L226 Difference]: Without dead ends: 8819 [2018-12-02 23:26:16,235 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:26:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8819 states. [2018-12-02 23:26:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8819 to 6299. [2018-12-02 23:26:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6299 states. [2018-12-02 23:26:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 14557 transitions. [2018-12-02 23:26:16,286 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 14557 transitions. Word has length 66 [2018-12-02 23:26:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:16,287 INFO L480 AbstractCegarLoop]: Abstraction has 6299 states and 14557 transitions. [2018-12-02 23:26:16,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:26:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 14557 transitions. [2018-12-02 23:26:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 23:26:16,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:16,290 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:26:16,290 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:16,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:16,290 INFO L82 PathProgramCache]: Analyzing trace with hash 280585492, now seen corresponding path program 1 times [2018-12-02 23:26:16,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:16,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:16,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:16,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:16,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:16,325 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:26:16,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:16,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:26:16,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:16,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:26:16,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:26:16,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:26:16,326 INFO L87 Difference]: Start difference. First operand 6299 states and 14557 transitions. Second operand 5 states. [2018-12-02 23:26:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:16,412 INFO L93 Difference]: Finished difference Result 7469 states and 17198 transitions. [2018-12-02 23:26:16,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:26:16,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-02 23:26:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:16,417 INFO L225 Difference]: With dead ends: 7469 [2018-12-02 23:26:16,417 INFO L226 Difference]: Without dead ends: 7469 [2018-12-02 23:26:16,417 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:26:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2018-12-02 23:26:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 6743. [2018-12-02 23:26:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6743 states. [2018-12-02 23:26:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6743 states to 6743 states and 15561 transitions. [2018-12-02 23:26:16,465 INFO L78 Accepts]: Start accepts. Automaton has 6743 states and 15561 transitions. Word has length 72 [2018-12-02 23:26:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:16,465 INFO L480 AbstractCegarLoop]: Abstraction has 6743 states and 15561 transitions. [2018-12-02 23:26:16,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:26:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 6743 states and 15561 transitions. [2018-12-02 23:26:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 23:26:16,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:16,469 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:26:16,469 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:16,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:16,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2023395827, now seen corresponding path program 1 times [2018-12-02 23:26:16,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:16,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:16,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:16,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:16,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:16,561 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:26:16,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:16,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 23:26:16,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:16,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 23:26:16,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 23:26:16,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:26:16,561 INFO L87 Difference]: Start difference. First operand 6743 states and 15561 transitions. Second operand 9 states. [2018-12-02 23:26:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:16,888 INFO L93 Difference]: Finished difference Result 8945 states and 20482 transitions. [2018-12-02 23:26:16,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 23:26:16,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-02 23:26:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:16,894 INFO L225 Difference]: With dead ends: 8945 [2018-12-02 23:26:16,894 INFO L226 Difference]: Without dead ends: 8826 [2018-12-02 23:26:16,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-02 23:26:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8826 states. [2018-12-02 23:26:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8826 to 6840. [2018-12-02 23:26:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2018-12-02 23:26:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 15654 transitions. [2018-12-02 23:26:16,948 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 15654 transitions. Word has length 72 [2018-12-02 23:26:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:16,948 INFO L480 AbstractCegarLoop]: Abstraction has 6840 states and 15654 transitions. [2018-12-02 23:26:16,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 23:26:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 15654 transitions. [2018-12-02 23:26:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:26:16,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:16,953 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:26:16,953 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:16,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash -755254731, now seen corresponding path program 1 times [2018-12-02 23:26:16,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:16,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:16,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:16,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:16,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:16,994 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:26:16,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:16,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:26:16,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:16,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:26:16,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:26:16,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:26:16,995 INFO L87 Difference]: Start difference. First operand 6840 states and 15654 transitions. Second operand 4 states. [2018-12-02 23:26:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:17,173 INFO L93 Difference]: Finished difference Result 10607 states and 24141 transitions. [2018-12-02 23:26:17,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:26:17,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 23:26:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:17,181 INFO L225 Difference]: With dead ends: 10607 [2018-12-02 23:26:17,181 INFO L226 Difference]: Without dead ends: 10607 [2018-12-02 23:26:17,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:26:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10607 states. [2018-12-02 23:26:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10607 to 7960. [2018-12-02 23:26:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7960 states. [2018-12-02 23:26:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7960 states to 7960 states and 17988 transitions. [2018-12-02 23:26:17,251 INFO L78 Accepts]: Start accepts. Automaton has 7960 states and 17988 transitions. Word has length 91 [2018-12-02 23:26:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:17,251 INFO L480 AbstractCegarLoop]: Abstraction has 7960 states and 17988 transitions. [2018-12-02 23:26:17,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:26:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7960 states and 17988 transitions. [2018-12-02 23:26:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:26:17,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:17,257 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:26:17,257 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:17,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1154554199, now seen corresponding path program 1 times [2018-12-02 23:26:17,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:17,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:17,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:26:17,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:17,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:26:17,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:17,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:26:17,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:26:17,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:26:17,300 INFO L87 Difference]: Start difference. First operand 7960 states and 17988 transitions. Second operand 4 states. [2018-12-02 23:26:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:17,361 INFO L93 Difference]: Finished difference Result 8525 states and 19281 transitions. [2018-12-02 23:26:17,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:26:17,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 23:26:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:17,369 INFO L225 Difference]: With dead ends: 8525 [2018-12-02 23:26:17,370 INFO L226 Difference]: Without dead ends: 8525 [2018-12-02 23:26:17,370 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:26:17,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8525 states. [2018-12-02 23:26:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8525 to 7866. [2018-12-02 23:26:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7866 states. [2018-12-02 23:26:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7866 states to 7866 states and 17883 transitions. [2018-12-02 23:26:17,432 INFO L78 Accepts]: Start accepts. Automaton has 7866 states and 17883 transitions. Word has length 91 [2018-12-02 23:26:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:17,432 INFO L480 AbstractCegarLoop]: Abstraction has 7866 states and 17883 transitions. [2018-12-02 23:26:17,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:26:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 7866 states and 17883 transitions. [2018-12-02 23:26:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:26:17,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:17,438 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:26:17,438 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:17,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:17,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2080314235, now seen corresponding path program 1 times [2018-12-02 23:26:17,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:17,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:17,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:17,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:17,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:17,501 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:26:17,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:17,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:26:17,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:17,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:26:17,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:26:17,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:26:17,502 INFO L87 Difference]: Start difference. First operand 7866 states and 17883 transitions. Second operand 7 states. [2018-12-02 23:26:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:17,915 INFO L93 Difference]: Finished difference Result 9704 states and 21991 transitions. [2018-12-02 23:26:17,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:26:17,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 23:26:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:17,922 INFO L225 Difference]: With dead ends: 9704 [2018-12-02 23:26:17,922 INFO L226 Difference]: Without dead ends: 9704 [2018-12-02 23:26:17,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:26:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9704 states. [2018-12-02 23:26:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9704 to 7978. [2018-12-02 23:26:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7978 states. [2018-12-02 23:26:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7978 states to 7978 states and 18203 transitions. [2018-12-02 23:26:17,990 INFO L78 Accepts]: Start accepts. Automaton has 7978 states and 18203 transitions. Word has length 93 [2018-12-02 23:26:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:17,991 INFO L480 AbstractCegarLoop]: Abstraction has 7978 states and 18203 transitions. [2018-12-02 23:26:17,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:26:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 7978 states and 18203 transitions. [2018-12-02 23:26:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:26:17,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:17,996 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:26:17,996 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:17,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:17,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1775857056, now seen corresponding path program 1 times [2018-12-02 23:26:17,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:17,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:17,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:17,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:17,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:18,035 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:26:18,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:18,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:26:18,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:18,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:26:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:26:18,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:26:18,036 INFO L87 Difference]: Start difference. First operand 7978 states and 18203 transitions. Second operand 5 states. [2018-12-02 23:26:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:18,118 INFO L93 Difference]: Finished difference Result 8885 states and 20161 transitions. [2018-12-02 23:26:18,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:26:18,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 23:26:18,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:18,127 INFO L225 Difference]: With dead ends: 8885 [2018-12-02 23:26:18,127 INFO L226 Difference]: Without dead ends: 8885 [2018-12-02 23:26:18,127 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:26:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8885 states. [2018-12-02 23:26:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8885 to 6874. [2018-12-02 23:26:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2018-12-02 23:26:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 15722 transitions. [2018-12-02 23:26:18,188 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 15722 transitions. Word has length 93 [2018-12-02 23:26:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:18,188 INFO L480 AbstractCegarLoop]: Abstraction has 6874 states and 15722 transitions. [2018-12-02 23:26:18,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:26:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 15722 transitions. [2018-12-02 23:26:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:26:18,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:18,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:18,193 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:18,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2030593601, now seen corresponding path program 1 times [2018-12-02 23:26:18,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:18,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:18,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:18,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:18,235 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:26:18,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:18,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:26:18,236 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:18,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:26:18,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:26:18,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:26:18,236 INFO L87 Difference]: Start difference. First operand 6874 states and 15722 transitions. Second operand 5 states. [2018-12-02 23:26:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:18,504 INFO L93 Difference]: Finished difference Result 11408 states and 26291 transitions. [2018-12-02 23:26:18,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:26:18,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 23:26:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:18,511 INFO L225 Difference]: With dead ends: 11408 [2018-12-02 23:26:18,511 INFO L226 Difference]: Without dead ends: 11330 [2018-12-02 23:26:18,512 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:26:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11330 states. [2018-12-02 23:26:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11330 to 8015. [2018-12-02 23:26:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8015 states. [2018-12-02 23:26:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 18369 transitions. [2018-12-02 23:26:18,583 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 18369 transitions. Word has length 93 [2018-12-02 23:26:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:18,583 INFO L480 AbstractCegarLoop]: Abstraction has 8015 states and 18369 transitions. [2018-12-02 23:26:18,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:26:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 18369 transitions. [2018-12-02 23:26:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:26:18,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:18,590 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:26:18,590 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:18,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:18,590 INFO L82 PathProgramCache]: Analyzing trace with hash -785829120, now seen corresponding path program 1 times [2018-12-02 23:26:18,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:18,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:18,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:18,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:18,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:26:18,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:18,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:26:18,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:18,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:26:18,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:26:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:26:18,645 INFO L87 Difference]: Start difference. First operand 8015 states and 18369 transitions. Second operand 6 states. [2018-12-02 23:26:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:18,848 INFO L93 Difference]: Finished difference Result 10150 states and 23091 transitions. [2018-12-02 23:26:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:26:18,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 23:26:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:18,854 INFO L225 Difference]: With dead ends: 10150 [2018-12-02 23:26:18,854 INFO L226 Difference]: Without dead ends: 10071 [2018-12-02 23:26:18,855 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:26:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10071 states. [2018-12-02 23:26:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10071 to 7614. [2018-12-02 23:26:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2018-12-02 23:26:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 17479 transitions. [2018-12-02 23:26:18,936 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 17479 transitions. Word has length 93 [2018-12-02 23:26:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:18,936 INFO L480 AbstractCegarLoop]: Abstraction has 7614 states and 17479 transitions. [2018-12-02 23:26:18,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:26:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 17479 transitions. [2018-12-02 23:26:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:26:18,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:18,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:26:18,943 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:18,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:18,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1879438691, now seen corresponding path program 1 times [2018-12-02 23:26:18,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:18,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:18,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:18,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:18,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:19,053 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:26:19,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:19,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 23:26:19,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:19,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 23:26:19,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 23:26:19,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:26:19,054 INFO L87 Difference]: Start difference. First operand 7614 states and 17479 transitions. Second operand 9 states. [2018-12-02 23:26:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:19,404 INFO L93 Difference]: Finished difference Result 10662 states and 24405 transitions. [2018-12-02 23:26:19,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 23:26:19,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-02 23:26:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:19,412 INFO L225 Difference]: With dead ends: 10662 [2018-12-02 23:26:19,412 INFO L226 Difference]: Without dead ends: 10630 [2018-12-02 23:26:19,413 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:26:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10630 states. [2018-12-02 23:26:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10630 to 9163. [2018-12-02 23:26:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9163 states. [2018-12-02 23:26:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9163 states to 9163 states and 20929 transitions. [2018-12-02 23:26:19,488 INFO L78 Accepts]: Start accepts. Automaton has 9163 states and 20929 transitions. Word has length 93 [2018-12-02 23:26:19,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:19,488 INFO L480 AbstractCegarLoop]: Abstraction has 9163 states and 20929 transitions. [2018-12-02 23:26:19,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 23:26:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 9163 states and 20929 transitions. [2018-12-02 23:26:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:26:19,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:19,494 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:26:19,494 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:19,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:19,494 INFO L82 PathProgramCache]: Analyzing trace with hash 618577246, now seen corresponding path program 1 times [2018-12-02 23:26:19,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:19,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:19,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:19,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:19,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:19,561 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:26:19,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:19,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 23:26:19,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:19,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 23:26:19,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:26:19,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:26:19,561 INFO L87 Difference]: Start difference. First operand 9163 states and 20929 transitions. Second operand 8 states. [2018-12-02 23:26:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:19,868 INFO L93 Difference]: Finished difference Result 14219 states and 32893 transitions. [2018-12-02 23:26:19,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:26:19,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-02 23:26:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:19,876 INFO L225 Difference]: With dead ends: 14219 [2018-12-02 23:26:19,876 INFO L226 Difference]: Without dead ends: 14219 [2018-12-02 23:26:19,877 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:26:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14219 states. [2018-12-02 23:26:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14219 to 9753. [2018-12-02 23:26:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9753 states. [2018-12-02 23:26:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9753 states to 9753 states and 22460 transitions. [2018-12-02 23:26:19,968 INFO L78 Accepts]: Start accepts. Automaton has 9753 states and 22460 transitions. Word has length 93 [2018-12-02 23:26:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:19,968 INFO L480 AbstractCegarLoop]: Abstraction has 9753 states and 22460 transitions. [2018-12-02 23:26:19,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 23:26:19,968 INFO L276 IsEmpty]: Start isEmpty. Operand 9753 states and 22460 transitions. [2018-12-02 23:26:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:26:19,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:19,975 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:26:19,975 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:19,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:19,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1506080927, now seen corresponding path program 1 times [2018-12-02 23:26:19,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:19,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:19,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:19,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:19,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:20,055 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:26:20,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:20,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 23:26:20,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:20,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 23:26:20,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 23:26:20,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:26:20,055 INFO L87 Difference]: Start difference. First operand 9753 states and 22460 transitions. Second operand 10 states. [2018-12-02 23:26:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:20,457 INFO L93 Difference]: Finished difference Result 13625 states and 31492 transitions. [2018-12-02 23:26:20,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 23:26:20,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-02 23:26:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:20,466 INFO L225 Difference]: With dead ends: 13625 [2018-12-02 23:26:20,466 INFO L226 Difference]: Without dead ends: 13625 [2018-12-02 23:26:20,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-12-02 23:26:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13625 states. [2018-12-02 23:26:20,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13625 to 10970. [2018-12-02 23:26:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10970 states. [2018-12-02 23:26:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10970 states to 10970 states and 25091 transitions. [2018-12-02 23:26:20,558 INFO L78 Accepts]: Start accepts. Automaton has 10970 states and 25091 transitions. Word has length 93 [2018-12-02 23:26:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:20,558 INFO L480 AbstractCegarLoop]: Abstraction has 10970 states and 25091 transitions. [2018-12-02 23:26:20,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 23:26:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 10970 states and 25091 transitions. [2018-12-02 23:26:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:26:20,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:20,565 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:26:20,565 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:20,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:20,566 INFO L82 PathProgramCache]: Analyzing trace with hash -225894625, now seen corresponding path program 1 times [2018-12-02 23:26:20,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:20,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:20,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:20,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:20,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:20,642 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:26:20,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:20,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:26:20,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:20,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:26:20,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:26:20,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:26:20,643 INFO L87 Difference]: Start difference. First operand 10970 states and 25091 transitions. Second operand 6 states. [2018-12-02 23:26:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:20,713 INFO L93 Difference]: Finished difference Result 10490 states and 23635 transitions. [2018-12-02 23:26:20,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:26:20,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 23:26:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:20,719 INFO L225 Difference]: With dead ends: 10490 [2018-12-02 23:26:20,719 INFO L226 Difference]: Without dead ends: 10490 [2018-12-02 23:26:20,719 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:26:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10490 states. [2018-12-02 23:26:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10490 to 7136. [2018-12-02 23:26:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2018-12-02 23:26:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 16093 transitions. [2018-12-02 23:26:20,788 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 16093 transitions. Word has length 93 [2018-12-02 23:26:20,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:20,788 INFO L480 AbstractCegarLoop]: Abstraction has 7136 states and 16093 transitions. [2018-12-02 23:26:20,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:26:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 16093 transitions. [2018-12-02 23:26:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:26:20,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:20,793 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:26:20,793 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:20,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:20,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1574972597, now seen corresponding path program 1 times [2018-12-02 23:26:20,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:20,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:20,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:20,882 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:26:20,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:20,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 23:26:20,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:20,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 23:26:20,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 23:26:20,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:26:20,884 INFO L87 Difference]: Start difference. First operand 7136 states and 16093 transitions. Second operand 9 states. [2018-12-02 23:26:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:21,150 INFO L93 Difference]: Finished difference Result 8480 states and 18944 transitions. [2018-12-02 23:26:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 23:26:21,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-02 23:26:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:21,155 INFO L225 Difference]: With dead ends: 8480 [2018-12-02 23:26:21,155 INFO L226 Difference]: Without dead ends: 8480 [2018-12-02 23:26:21,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-02 23:26:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8480 states. [2018-12-02 23:26:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8480 to 8214. [2018-12-02 23:26:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8214 states. [2018-12-02 23:26:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8214 states to 8214 states and 18420 transitions. [2018-12-02 23:26:21,212 INFO L78 Accepts]: Start accepts. Automaton has 8214 states and 18420 transitions. Word has length 95 [2018-12-02 23:26:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:21,212 INFO L480 AbstractCegarLoop]: Abstraction has 8214 states and 18420 transitions. [2018-12-02 23:26:21,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 23:26:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 8214 states and 18420 transitions. [2018-12-02 23:26:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:26:21,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:21,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:21,217 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:21,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash -687468916, now seen corresponding path program 1 times [2018-12-02 23:26:21,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:21,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:21,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:21,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:21,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:21,314 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:26:21,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:21,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 23:26:21,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:21,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 23:26:21,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 23:26:21,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:26:21,314 INFO L87 Difference]: Start difference. First operand 8214 states and 18420 transitions. Second operand 11 states. [2018-12-02 23:26:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:22,357 INFO L93 Difference]: Finished difference Result 15152 states and 34122 transitions. [2018-12-02 23:26:22,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 23:26:22,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 23:26:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:22,367 INFO L225 Difference]: With dead ends: 15152 [2018-12-02 23:26:22,367 INFO L226 Difference]: Without dead ends: 10596 [2018-12-02 23:26:22,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 23:26:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10596 states. [2018-12-02 23:26:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10596 to 7968. [2018-12-02 23:26:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7968 states. [2018-12-02 23:26:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7968 states to 7968 states and 17844 transitions. [2018-12-02 23:26:22,437 INFO L78 Accepts]: Start accepts. Automaton has 7968 states and 17844 transitions. Word has length 95 [2018-12-02 23:26:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:22,437 INFO L480 AbstractCegarLoop]: Abstraction has 7968 states and 17844 transitions. [2018-12-02 23:26:22,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 23:26:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 7968 states and 17844 transitions. [2018-12-02 23:26:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:26:22,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:22,442 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:26:22,442 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:22,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:22,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1086118301, now seen corresponding path program 1 times [2018-12-02 23:26:22,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:22,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:22,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:22,513 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:26:22,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:22,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:26:22,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:22,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:26:22,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:26:22,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:26:22,514 INFO L87 Difference]: Start difference. First operand 7968 states and 17844 transitions. Second operand 6 states. [2018-12-02 23:26:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:22,622 INFO L93 Difference]: Finished difference Result 8947 states and 19761 transitions. [2018-12-02 23:26:22,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:26:22,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 23:26:22,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:22,627 INFO L225 Difference]: With dead ends: 8947 [2018-12-02 23:26:22,628 INFO L226 Difference]: Without dead ends: 8890 [2018-12-02 23:26:22,628 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:26:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8890 states. [2018-12-02 23:26:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8890 to 7966. [2018-12-02 23:26:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7966 states. [2018-12-02 23:26:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 17669 transitions. [2018-12-02 23:26:22,687 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 17669 transitions. Word has length 95 [2018-12-02 23:26:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:22,688 INFO L480 AbstractCegarLoop]: Abstraction has 7966 states and 17669 transitions. [2018-12-02 23:26:22,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:26:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 17669 transitions. [2018-12-02 23:26:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:26:22,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:22,693 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:26:22,693 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:22,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:22,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1904255005, now seen corresponding path program 2 times [2018-12-02 23:26:22,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:22,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:22,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:26:22,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:22,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:26:22,737 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:26:22,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:26:22,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:26:22,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:26:22,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:26:22,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:26:22,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:26:22,738 INFO L87 Difference]: Start difference. First operand 7966 states and 17669 transitions. Second operand 6 states. [2018-12-02 23:26:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:26:22,833 INFO L93 Difference]: Finished difference Result 8186 states and 18114 transitions. [2018-12-02 23:26:22,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:26:22,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 23:26:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:26:22,839 INFO L225 Difference]: With dead ends: 8186 [2018-12-02 23:26:22,839 INFO L226 Difference]: Without dead ends: 8186 [2018-12-02 23:26:22,839 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:26:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8186 states. [2018-12-02 23:26:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8186 to 7872. [2018-12-02 23:26:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7872 states. [2018-12-02 23:26:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7872 states to 7872 states and 17459 transitions. [2018-12-02 23:26:22,894 INFO L78 Accepts]: Start accepts. Automaton has 7872 states and 17459 transitions. Word has length 95 [2018-12-02 23:26:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:26:22,894 INFO L480 AbstractCegarLoop]: Abstraction has 7872 states and 17459 transitions. [2018-12-02 23:26:22,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:26:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 7872 states and 17459 transitions. [2018-12-02 23:26:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:26:22,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:26:22,900 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:26:22,900 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:26:22,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:26:22,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1415884062, now seen corresponding path program 2 times [2018-12-02 23:26:22,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:26:22,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:22,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:26:22,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:26:22,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:26:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:26:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:26:22,937 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 23:26:23,004 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 23:26:23,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:26:23 BasicIcfg [2018-12-02 23:26:23,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 23:26:23,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:26:23,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:26:23,006 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:26:23,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:26:05" (3/4) ... [2018-12-02 23:26:23,008 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 23:26:23,079 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_db0c2a2f-9395-41de-8856-1d25d6a50970/bin-2019/utaipan/witness.graphml [2018-12-02 23:26:23,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:26:23,080 INFO L168 Benchmark]: Toolchain (without parser) took 18695.73 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 955.3 MB in the beginning and 945.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-02 23:26:23,081 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:26:23,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-02 23:26:23,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 23:26:23,081 INFO L168 Benchmark]: Boogie Preprocessor took 20.00 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:26:23,082 INFO L168 Benchmark]: RCFGBuilder took 334.89 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-12-02 23:26:23,082 INFO L168 Benchmark]: TraceAbstraction took 17908.62 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 979.8 MB in the end (delta: 76.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-02 23:26:23,082 INFO L168 Benchmark]: Witness Printer took 73.40 ms. Allocated memory is still 2.8 GB. Free memory was 979.8 MB in the beginning and 945.6 MB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-02 23:26:23,084 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.00 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 334.89 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17908.62 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 979.8 MB in the end (delta: 76.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 73.40 ms. Allocated memory is still 2.8 GB. Free memory was 979.8 MB in the beginning and 945.6 MB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 pthread_t t597; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] FCALL, FORK -1 pthread_create(&t597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L775] -1 pthread_t t598; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L776] FCALL, FORK -1 pthread_create(&t598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L729] 1 x = 2 [L732] 1 __unbuffered_p1_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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 = !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) [L740] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, 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_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)) [L741] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, 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$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)) [L742] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_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)) [L743] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_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)) [L744] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$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)) [L745] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$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)) [L746] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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) [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L751] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L751] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L751] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L751] 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) [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L752] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L753] 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 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L754] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L755] 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 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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 = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L784] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y$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 [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L786] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$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 [L789] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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, 17.8s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8825 SDtfs, 10265 SDslu, 20885 SDs, 0 SdLazy, 9764 SolverSat, 499 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 90 SyntacticMatches, 32 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35807occurred 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.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 93403 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2543 NumberOfCodeBlocks, 2543 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2415 ConstructedInterpolants, 0 QuantifiedInterpolants, 532614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...