./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:21:07,657 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:21:07,658 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:21:07,664 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:21:07,665 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:21:07,665 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:21:07,666 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:21:07,667 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:21:07,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:21:07,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:21:07,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:21:07,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:21:07,670 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:21:07,671 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:21:07,672 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:21:07,672 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:21:07,673 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:21:07,674 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:21:07,676 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:21:07,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:21:07,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:21:07,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:21:07,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:21:07,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:21:07,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:21:07,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:21:07,682 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:21:07,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:21:07,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:21:07,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:21:07,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:21:07,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:21:07,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:21:07,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:21:07,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:21:07,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:21:07,687 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 12:21:07,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:21:07,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:21:07,697 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:21:07,698 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:21:07,698 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:21:07,698 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:21:07,698 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:21:07,698 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:21:07,698 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:21:07,699 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:21:07,699 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:21:07,699 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:21:07,699 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:21:07,699 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:21:07,700 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:21:07,700 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:21:07,700 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:21:07,700 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:21:07,700 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:21:07,700 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:21:07,701 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:21:07,701 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:21:07,701 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:21:07,701 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:21:07,701 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:21:07,701 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:21:07,701 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:21:07,702 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:21:07,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:21:07,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:21:07,702 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:21:07,702 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:21:07,702 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:21:07,702 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:21:07,703 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:21:07,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:21:07,703 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:21:07,703 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_9a51219b-7563-4467-9e78-52c57c918a8f/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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-11-23 12:21:07,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:21:07,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:21:07,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:21:07,737 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:21:07,737 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:21:07,738 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:21:07,773 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/bin-2019/utaipan/data/e7ab8b82b/7b9dc1ae70114500822239086337b8aa/FLAG118368df1 [2018-11-23 12:21:08,074 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:21:08,075 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:21:08,080 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/bin-2019/utaipan/data/e7ab8b82b/7b9dc1ae70114500822239086337b8aa/FLAG118368df1 [2018-11-23 12:21:08,089 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/bin-2019/utaipan/data/e7ab8b82b/7b9dc1ae70114500822239086337b8aa [2018-11-23 12:21:08,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:21:08,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:21:08,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:21:08,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:21:08,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:21:08,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:08" (1/1) ... [2018-11-23 12:21:08,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22877cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08, skipping insertion in model container [2018-11-23 12:21:08,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:08" (1/1) ... [2018-11-23 12:21:08,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:21:08,119 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:21:08,230 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:21:08,232 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:21:08,249 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:21:08,257 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:21:08,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08 WrapperNode [2018-11-23 12:21:08,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:21:08,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:21:08,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:21:08,258 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:21:08,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08" (1/1) ... [2018-11-23 12:21:08,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08" (1/1) ... [2018-11-23 12:21:08,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:21:08,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:21:08,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:21:08,271 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:21:08,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08" (1/1) ... [2018-11-23 12:21:08,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08" (1/1) ... [2018-11-23 12:21:08,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08" (1/1) ... [2018-11-23 12:21:08,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08" (1/1) ... [2018-11-23 12:21:08,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08" (1/1) ... [2018-11-23 12:21:08,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08" (1/1) ... [2018-11-23 12:21:08,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08" (1/1) ... [2018-11-23 12:21:08,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:21:08,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:21:08,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:21:08,332 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:21:08,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/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-11-23 12:21:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:21:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:21:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:21:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:21:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:21:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:21:08,594 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:21:08,594 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:21:08,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:08 BoogieIcfgContainer [2018-11-23 12:21:08,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:21:08,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:21:08,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:21:08,598 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:21:08,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:21:08" (1/3) ... [2018-11-23 12:21:08,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b17e6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:08, skipping insertion in model container [2018-11-23 12:21:08,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:08" (2/3) ... [2018-11-23 12:21:08,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b17e6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:08, skipping insertion in model container [2018-11-23 12:21:08,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:08" (3/3) ... [2018-11-23 12:21:08,600 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:21:08,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:21:08,615 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:21:08,629 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:21:08,655 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:21:08,656 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:21:08,656 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:21:08,656 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:21:08,656 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:21:08,656 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:21:08,656 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:21:08,656 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:21:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 12:21:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:21:08,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:08,675 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] [2018-11-23 12:21:08,677 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:08,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:08,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2018-11-23 12:21:08,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:08,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:08,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:08,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:08,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:08,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:08,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:08,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:08,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:08,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:08,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:08,833 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-11-23 12:21:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:08,868 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2018-11-23 12:21:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:08,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:21:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:08,876 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:21:08,877 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:21:08,879 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-11-23 12:21:08,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:21:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-11-23 12:21:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:21:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-11-23 12:21:08,904 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2018-11-23 12:21:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:08,905 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2018-11-23 12:21:08,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-11-23 12:21:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:21:08,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:08,906 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] [2018-11-23 12:21:08,906 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:08,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2018-11-23 12:21:08,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:08,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:08,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:08,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:08,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:08,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:08,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:08,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:08,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:08,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:08,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:08,954 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2018-11-23 12:21:08,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:08,984 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2018-11-23 12:21:08,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:08,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:21:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:08,986 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:21:08,986 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:21:08,987 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-11-23 12:21:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:21:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-23 12:21:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:21:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2018-11-23 12:21:08,994 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2018-11-23 12:21:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:08,994 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2018-11-23 12:21:08,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2018-11-23 12:21:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:21:08,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:08,995 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] [2018-11-23 12:21:08,995 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:08,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:08,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2018-11-23 12:21:08,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:08,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:08,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:08,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:08,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,026 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2018-11-23 12:21:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,043 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2018-11-23 12:21:09,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:21:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,044 INFO L225 Difference]: With dead ends: 126 [2018-11-23 12:21:09,044 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:21:09,044 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-11-23 12:21:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:21:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:21:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:21:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2018-11-23 12:21:09,048 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2018-11-23 12:21:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,049 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2018-11-23 12:21:09,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2018-11-23 12:21:09,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:21:09,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,049 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] [2018-11-23 12:21:09,049 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,049 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2018-11-23 12:21:09,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,082 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2018-11-23 12:21:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,098 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2018-11-23 12:21:09,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:21:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,099 INFO L225 Difference]: With dead ends: 160 [2018-11-23 12:21:09,099 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 12:21:09,099 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-11-23 12:21:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 12:21:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2018-11-23 12:21:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 12:21:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2018-11-23 12:21:09,106 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2018-11-23 12:21:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,106 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2018-11-23 12:21:09,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2018-11-23 12:21:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:21:09,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,108 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] [2018-11-23 12:21:09,108 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,108 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2018-11-23 12:21:09,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,153 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2018-11-23 12:21:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,170 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2018-11-23 12:21:09,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:21:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,171 INFO L225 Difference]: With dead ends: 264 [2018-11-23 12:21:09,172 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 12:21:09,172 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-11-23 12:21:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 12:21:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-11-23 12:21:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 12:21:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2018-11-23 12:21:09,182 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2018-11-23 12:21:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,182 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2018-11-23 12:21:09,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2018-11-23 12:21:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:21:09,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,183 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] [2018-11-23 12:21:09,183 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,184 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2018-11-23 12:21:09,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,210 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2018-11-23 12:21:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,237 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2018-11-23 12:21:09,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:21:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,239 INFO L225 Difference]: With dead ends: 237 [2018-11-23 12:21:09,239 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 12:21:09,239 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-11-23 12:21:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 12:21:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-23 12:21:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 12:21:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2018-11-23 12:21:09,248 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2018-11-23 12:21:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,248 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2018-11-23 12:21:09,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2018-11-23 12:21:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:21:09,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,249 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] [2018-11-23 12:21:09,249 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2018-11-23 12:21:09,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,281 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2018-11-23 12:21:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,298 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2018-11-23 12:21:09,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:21:09,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,300 INFO L225 Difference]: With dead ends: 300 [2018-11-23 12:21:09,301 INFO L226 Difference]: Without dead ends: 298 [2018-11-23 12:21:09,301 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-11-23 12:21:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-23 12:21:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2018-11-23 12:21:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-23 12:21:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2018-11-23 12:21:09,312 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2018-11-23 12:21:09,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,312 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2018-11-23 12:21:09,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2018-11-23 12:21:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:21:09,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,314 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] [2018-11-23 12:21:09,314 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2018-11-23 12:21:09,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,349 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2018-11-23 12:21:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,372 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2018-11-23 12:21:09,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:21:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,374 INFO L225 Difference]: With dead ends: 512 [2018-11-23 12:21:09,374 INFO L226 Difference]: Without dead ends: 306 [2018-11-23 12:21:09,375 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-11-23 12:21:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-23 12:21:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-23 12:21:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-23 12:21:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2018-11-23 12:21:09,386 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2018-11-23 12:21:09,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,386 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2018-11-23 12:21:09,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2018-11-23 12:21:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:21:09,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:09,388 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,388 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2018-11-23 12:21:09,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,410 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2018-11-23 12:21:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,432 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2018-11-23 12:21:09,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:21:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,433 INFO L225 Difference]: With dead ends: 456 [2018-11-23 12:21:09,433 INFO L226 Difference]: Without dead ends: 310 [2018-11-23 12:21:09,434 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-11-23 12:21:09,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-23 12:21:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-11-23 12:21:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-23 12:21:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2018-11-23 12:21:09,443 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2018-11-23 12:21:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,444 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2018-11-23 12:21:09,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2018-11-23 12:21:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:21:09,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,445 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] [2018-11-23 12:21:09,445 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2018-11-23 12:21:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,465 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2018-11-23 12:21:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,495 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2018-11-23 12:21:09,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:21:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,497 INFO L225 Difference]: With dead ends: 572 [2018-11-23 12:21:09,497 INFO L226 Difference]: Without dead ends: 570 [2018-11-23 12:21:09,498 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-11-23 12:21:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-23 12:21:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2018-11-23 12:21:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-23 12:21:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2018-11-23 12:21:09,509 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2018-11-23 12:21:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,510 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2018-11-23 12:21:09,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,510 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2018-11-23 12:21:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:21:09,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,511 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] [2018-11-23 12:21:09,511 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2018-11-23 12:21:09,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,537 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2018-11-23 12:21:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,556 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2018-11-23 12:21:09,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:21:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,557 INFO L225 Difference]: With dead ends: 1004 [2018-11-23 12:21:09,557 INFO L226 Difference]: Without dead ends: 594 [2018-11-23 12:21:09,558 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-11-23 12:21:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-11-23 12:21:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2018-11-23 12:21:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-23 12:21:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2018-11-23 12:21:09,570 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2018-11-23 12:21:09,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,571 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2018-11-23 12:21:09,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2018-11-23 12:21:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:21:09,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,572 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] [2018-11-23 12:21:09,572 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,572 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2018-11-23 12:21:09,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,613 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2018-11-23 12:21:09,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,625 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2018-11-23 12:21:09,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:21:09,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,627 INFO L225 Difference]: With dead ends: 888 [2018-11-23 12:21:09,627 INFO L226 Difference]: Without dead ends: 602 [2018-11-23 12:21:09,627 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-11-23 12:21:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-23 12:21:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-11-23 12:21:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-23 12:21:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2018-11-23 12:21:09,638 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2018-11-23 12:21:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,638 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2018-11-23 12:21:09,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2018-11-23 12:21:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:21:09,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,639 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] [2018-11-23 12:21:09,639 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2018-11-23 12:21:09,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,655 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2018-11-23 12:21:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,675 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2018-11-23 12:21:09,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:21:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,678 INFO L225 Difference]: With dead ends: 1100 [2018-11-23 12:21:09,678 INFO L226 Difference]: Without dead ends: 1098 [2018-11-23 12:21:09,679 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-11-23 12:21:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-11-23 12:21:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2018-11-23 12:21:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-23 12:21:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2018-11-23 12:21:09,694 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2018-11-23 12:21:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,695 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2018-11-23 12:21:09,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2018-11-23 12:21:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:21:09,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,696 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] [2018-11-23 12:21:09,697 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2018-11-23 12:21:09,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,716 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2018-11-23 12:21:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,749 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2018-11-23 12:21:09,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:21:09,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,752 INFO L225 Difference]: With dead ends: 1980 [2018-11-23 12:21:09,752 INFO L226 Difference]: Without dead ends: 1162 [2018-11-23 12:21:09,753 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-11-23 12:21:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-11-23 12:21:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2018-11-23 12:21:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-11-23 12:21:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2018-11-23 12:21:09,776 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2018-11-23 12:21:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,776 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2018-11-23 12:21:09,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2018-11-23 12:21:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:21:09,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:09,778 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,779 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2018-11-23 12:21:09,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,800 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2018-11-23 12:21:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,824 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2018-11-23 12:21:09,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:21:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,827 INFO L225 Difference]: With dead ends: 1740 [2018-11-23 12:21:09,827 INFO L226 Difference]: Without dead ends: 1178 [2018-11-23 12:21:09,828 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-11-23 12:21:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-11-23 12:21:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2018-11-23 12:21:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-23 12:21:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2018-11-23 12:21:09,851 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2018-11-23 12:21:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,851 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2018-11-23 12:21:09,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2018-11-23 12:21:09,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:21:09,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,852 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] [2018-11-23 12:21:09,853 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,853 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2018-11-23 12:21:09,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,880 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2018-11-23 12:21:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:09,907 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2018-11-23 12:21:09,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:09,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:21:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:09,911 INFO L225 Difference]: With dead ends: 2124 [2018-11-23 12:21:09,911 INFO L226 Difference]: Without dead ends: 2122 [2018-11-23 12:21:09,912 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-11-23 12:21:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-23 12:21:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2018-11-23 12:21:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-11-23 12:21:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2018-11-23 12:21:09,958 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2018-11-23 12:21:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:09,958 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2018-11-23 12:21:09,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2018-11-23 12:21:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:21:09,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:09,960 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] [2018-11-23 12:21:09,960 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:09,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2018-11-23 12:21:09,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:09,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:09,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:09,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:09,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:09,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:09,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:09,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:09,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:09,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:09,984 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2018-11-23 12:21:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:10,021 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2018-11-23 12:21:10,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:10,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:21:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:10,026 INFO L225 Difference]: With dead ends: 3916 [2018-11-23 12:21:10,026 INFO L226 Difference]: Without dead ends: 2282 [2018-11-23 12:21:10,028 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-11-23 12:21:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2018-11-23 12:21:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2018-11-23 12:21:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-11-23 12:21:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2018-11-23 12:21:10,066 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2018-11-23 12:21:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:10,066 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2018-11-23 12:21:10,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2018-11-23 12:21:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:21:10,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:10,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:10,069 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:10,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:10,069 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2018-11-23 12:21:10,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:10,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:10,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:10,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:10,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:10,087 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:10,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:10,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:10,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:10,088 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2018-11-23 12:21:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:10,116 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2018-11-23 12:21:10,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:10,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:21:10,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:10,121 INFO L225 Difference]: With dead ends: 3420 [2018-11-23 12:21:10,121 INFO L226 Difference]: Without dead ends: 2314 [2018-11-23 12:21:10,122 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-11-23 12:21:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-11-23 12:21:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2018-11-23 12:21:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-11-23 12:21:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2018-11-23 12:21:10,162 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2018-11-23 12:21:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:10,162 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2018-11-23 12:21:10,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2018-11-23 12:21:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:21:10,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:10,164 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] [2018-11-23 12:21:10,165 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:10,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2018-11-23 12:21:10,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:10,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:10,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:10,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:10,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:10,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:10,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:10,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:10,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:10,184 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2018-11-23 12:21:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:10,228 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2018-11-23 12:21:10,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:10,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:21:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:10,235 INFO L225 Difference]: With dead ends: 4108 [2018-11-23 12:21:10,235 INFO L226 Difference]: Without dead ends: 4106 [2018-11-23 12:21:10,237 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-11-23 12:21:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-23 12:21:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2018-11-23 12:21:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-23 12:21:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2018-11-23 12:21:10,289 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2018-11-23 12:21:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:10,290 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2018-11-23 12:21:10,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2018-11-23 12:21:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:21:10,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:10,292 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] [2018-11-23 12:21:10,293 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:10,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:10,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2018-11-23 12:21:10,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:10,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:10,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:10,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:10,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:10,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:10,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:10,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:10,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:10,312 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2018-11-23 12:21:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:10,364 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2018-11-23 12:21:10,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:10,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:21:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:10,372 INFO L225 Difference]: With dead ends: 7756 [2018-11-23 12:21:10,372 INFO L226 Difference]: Without dead ends: 4490 [2018-11-23 12:21:10,375 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-11-23 12:21:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-11-23 12:21:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2018-11-23 12:21:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2018-11-23 12:21:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2018-11-23 12:21:10,448 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2018-11-23 12:21:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:10,448 INFO L480 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2018-11-23 12:21:10,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2018-11-23 12:21:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:21:10,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:10,451 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] [2018-11-23 12:21:10,451 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:10,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2018-11-23 12:21:10,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:10,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:10,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:10,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:10,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:10,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:10,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:10,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:10,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:10,464 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2018-11-23 12:21:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:10,517 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2018-11-23 12:21:10,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:10,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:21:10,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:10,544 INFO L225 Difference]: With dead ends: 6732 [2018-11-23 12:21:10,545 INFO L226 Difference]: Without dead ends: 4554 [2018-11-23 12:21:10,547 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-11-23 12:21:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-11-23 12:21:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2018-11-23 12:21:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2018-11-23 12:21:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2018-11-23 12:21:10,659 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2018-11-23 12:21:10,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:10,659 INFO L480 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2018-11-23 12:21:10,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2018-11-23 12:21:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:21:10,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:10,663 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] [2018-11-23 12:21:10,663 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:10,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2018-11-23 12:21:10,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:10,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:10,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:10,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:10,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:10,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:10,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:10,692 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2018-11-23 12:21:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:10,844 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2018-11-23 12:21:10,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:10,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:21:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:10,863 INFO L225 Difference]: With dead ends: 13260 [2018-11-23 12:21:10,863 INFO L226 Difference]: Without dead ends: 8842 [2018-11-23 12:21:10,870 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-11-23 12:21:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2018-11-23 12:21:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2018-11-23 12:21:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-23 12:21:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2018-11-23 12:21:11,078 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2018-11-23 12:21:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:11,079 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2018-11-23 12:21:11,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2018-11-23 12:21:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:21:11,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:11,085 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] [2018-11-23 12:21:11,085 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:11,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:11,086 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2018-11-23 12:21:11,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:11,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:11,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:11,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:11,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:11,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:11,105 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:11,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:11,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:11,105 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2018-11-23 12:21:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:11,252 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2018-11-23 12:21:11,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:11,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:21:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:11,269 INFO L225 Difference]: With dead ends: 10124 [2018-11-23 12:21:11,270 INFO L226 Difference]: Without dead ends: 10122 [2018-11-23 12:21:11,273 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-11-23 12:21:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2018-11-23 12:21:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2018-11-23 12:21:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-23 12:21:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2018-11-23 12:21:11,506 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2018-11-23 12:21:11,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:11,506 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2018-11-23 12:21:11,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2018-11-23 12:21:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:21:11,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:11,514 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] [2018-11-23 12:21:11,514 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:11,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2018-11-23 12:21:11,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:11,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:11,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:11,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:11,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:11,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:11,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:11,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:11,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:11,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:11,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:11,533 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2018-11-23 12:21:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:11,738 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2018-11-23 12:21:11,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:11,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:21:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:11,764 INFO L225 Difference]: With dead ends: 15244 [2018-11-23 12:21:11,764 INFO L226 Difference]: Without dead ends: 15242 [2018-11-23 12:21:11,769 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-11-23 12:21:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2018-11-23 12:21:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2018-11-23 12:21:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2018-11-23 12:21:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2018-11-23 12:21:11,999 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2018-11-23 12:21:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:11,999 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2018-11-23 12:21:12,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2018-11-23 12:21:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:21:12,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:12,012 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] [2018-11-23 12:21:12,012 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:12,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:12,013 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2018-11-23 12:21:12,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:12,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:12,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:12,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:12,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:12,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:12,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:12,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:12,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:12,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:12,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:12,052 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2018-11-23 12:21:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:12,367 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2018-11-23 12:21:12,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:12,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:21:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:12,391 INFO L225 Difference]: With dead ends: 30348 [2018-11-23 12:21:12,391 INFO L226 Difference]: Without dead ends: 17290 [2018-11-23 12:21:12,406 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-11-23 12:21:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2018-11-23 12:21:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2018-11-23 12:21:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2018-11-23 12:21:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2018-11-23 12:21:12,744 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2018-11-23 12:21:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:12,745 INFO L480 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2018-11-23 12:21:12,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2018-11-23 12:21:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:21:12,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:12,757 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] [2018-11-23 12:21:12,758 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:12,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:12,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2018-11-23 12:21:12,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:12,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:12,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:12,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:12,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:12,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:12,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:12,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:12,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:12,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:12,770 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2018-11-23 12:21:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:13,007 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2018-11-23 12:21:13,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:13,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:21:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:13,034 INFO L225 Difference]: With dead ends: 26124 [2018-11-23 12:21:13,034 INFO L226 Difference]: Without dead ends: 17674 [2018-11-23 12:21:13,049 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-11-23 12:21:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2018-11-23 12:21:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2018-11-23 12:21:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2018-11-23 12:21:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2018-11-23 12:21:13,457 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2018-11-23 12:21:13,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:13,457 INFO L480 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2018-11-23 12:21:13,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2018-11-23 12:21:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:21:13,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:13,470 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] [2018-11-23 12:21:13,471 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:13,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2018-11-23 12:21:13,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:13,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:13,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:13,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:13,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:13,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:13,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:13,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:13,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:13,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:13,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:13,488 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2018-11-23 12:21:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:13,881 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2018-11-23 12:21:13,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:13,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:21:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:13,926 INFO L225 Difference]: With dead ends: 29708 [2018-11-23 12:21:13,926 INFO L226 Difference]: Without dead ends: 29706 [2018-11-23 12:21:13,934 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-11-23 12:21:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2018-11-23 12:21:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2018-11-23 12:21:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2018-11-23 12:21:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2018-11-23 12:21:14,335 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2018-11-23 12:21:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:14,335 INFO L480 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2018-11-23 12:21:14,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2018-11-23 12:21:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:21:14,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:14,351 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] [2018-11-23 12:21:14,351 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:14,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:14,351 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2018-11-23 12:21:14,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:14,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:14,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:14,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:14,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:14,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:14,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:14,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:14,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:14,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:14,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:14,372 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2018-11-23 12:21:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:14,677 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2018-11-23 12:21:14,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:14,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:21:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:14,713 INFO L225 Difference]: With dead ends: 60428 [2018-11-23 12:21:14,713 INFO L226 Difference]: Without dead ends: 34314 [2018-11-23 12:21:14,737 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-11-23 12:21:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2018-11-23 12:21:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2018-11-23 12:21:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2018-11-23 12:21:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2018-11-23 12:21:15,430 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2018-11-23 12:21:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:15,430 INFO L480 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2018-11-23 12:21:15,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2018-11-23 12:21:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:21:15,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:15,447 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] [2018-11-23 12:21:15,447 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:15,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:15,447 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2018-11-23 12:21:15,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:15,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:15,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:15,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:15,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:15,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:15,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:15,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:15,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:15,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:15,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:15,488 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2018-11-23 12:21:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:15,832 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2018-11-23 12:21:15,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:15,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:21:15,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:15,870 INFO L225 Difference]: With dead ends: 51468 [2018-11-23 12:21:15,870 INFO L226 Difference]: Without dead ends: 34826 [2018-11-23 12:21:15,889 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-11-23 12:21:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2018-11-23 12:21:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2018-11-23 12:21:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2018-11-23 12:21:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2018-11-23 12:21:16,509 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2018-11-23 12:21:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:16,509 INFO L480 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2018-11-23 12:21:16,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2018-11-23 12:21:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:21:16,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:16,519 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] [2018-11-23 12:21:16,519 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:16,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:16,519 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2018-11-23 12:21:16,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:16,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:16,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:16,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:16,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:16,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:16,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:16,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:16,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:16,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:16,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:16,548 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2018-11-23 12:21:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:17,102 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2018-11-23 12:21:17,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:17,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:21:17,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:17,151 INFO L225 Difference]: With dead ends: 57356 [2018-11-23 12:21:17,151 INFO L226 Difference]: Without dead ends: 57354 [2018-11-23 12:21:17,160 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-11-23 12:21:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2018-11-23 12:21:17,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2018-11-23 12:21:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2018-11-23 12:21:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2018-11-23 12:21:17,977 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2018-11-23 12:21:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:17,977 INFO L480 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2018-11-23 12:21:17,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2018-11-23 12:21:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:21:18,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:18,006 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] [2018-11-23 12:21:18,007 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:18,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:18,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2018-11-23 12:21:18,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:18,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:18,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:18,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:18,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:18,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:18,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:18,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:18,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:18,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:18,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:18,044 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2018-11-23 12:21:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:18,669 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2018-11-23 12:21:18,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:18,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:21:18,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:18,727 INFO L225 Difference]: With dead ends: 119820 [2018-11-23 12:21:18,727 INFO L226 Difference]: Without dead ends: 67594 [2018-11-23 12:21:18,763 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-11-23 12:21:18,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2018-11-23 12:21:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2018-11-23 12:21:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2018-11-23 12:21:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2018-11-23 12:21:19,762 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2018-11-23 12:21:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:19,763 INFO L480 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2018-11-23 12:21:19,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2018-11-23 12:21:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:21:19,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:19,792 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-11-23 12:21:19,792 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:19,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:19,792 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2018-11-23 12:21:19,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:19,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:19,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:19,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:19,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:19,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:19,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:19,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:19,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:19,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:19,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:19,805 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2018-11-23 12:21:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:20,415 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2018-11-23 12:21:20,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:20,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 12:21:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:20,465 INFO L225 Difference]: With dead ends: 101388 [2018-11-23 12:21:20,465 INFO L226 Difference]: Without dead ends: 68618 [2018-11-23 12:21:20,488 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-11-23 12:21:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2018-11-23 12:21:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2018-11-23 12:21:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2018-11-23 12:21:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2018-11-23 12:21:21,573 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2018-11-23 12:21:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:21,574 INFO L480 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2018-11-23 12:21:21,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2018-11-23 12:21:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:21:21,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:21,596 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-11-23 12:21:21,597 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:21,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2018-11-23 12:21:21,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:21,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:21,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:21,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:21,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:21,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:21,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:21,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:21,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:21,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:21,636 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2018-11-23 12:21:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:22,741 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2018-11-23 12:21:22,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:22,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 12:21:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:22,812 INFO L225 Difference]: With dead ends: 110602 [2018-11-23 12:21:22,812 INFO L226 Difference]: Without dead ends: 110600 [2018-11-23 12:21:22,821 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-11-23 12:21:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2018-11-23 12:21:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2018-11-23 12:21:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2018-11-23 12:21:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2018-11-23 12:21:23,983 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2018-11-23 12:21:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:23,983 INFO L480 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2018-11-23 12:21:23,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2018-11-23 12:21:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:21:24,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:24,030 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-11-23 12:21:24,030 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:24,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:24,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2018-11-23 12:21:24,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:21:24,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:24,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:24,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:24,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:21:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:24,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:24,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:24,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:21:24,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:24,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:24,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:24,058 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2018-11-23 12:21:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:25,634 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2018-11-23 12:21:25,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:25,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 12:21:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:25,635 INFO L225 Difference]: With dead ends: 237576 [2018-11-23 12:21:25,635 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:21:25,723 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-11-23 12:21:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:21:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:21:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:21:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:21:25,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-23 12:21:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:25,724 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:21:25,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:21:25,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:25,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:21:25,771 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 12:21:25,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:21:25,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:21:25,771 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:21:25,771 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:21:25,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,772 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-11-23 12:21:25,772 INFO L451 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,773 INFO L451 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-23 12:21:25,773 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-11-23 12:21:25,774 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-11-23 12:21:25,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:21:25 BoogieIcfgContainer [2018-11-23 12:21:25,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:21:25,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:21:25,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:21:25,780 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:21:25,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:08" (3/4) ... [2018-11-23 12:21:25,783 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:21:25,787 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:21:25,787 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:21:25,792 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 12:21:25,793 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:21:25,793 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:21:25,838 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9a51219b-7563-4467-9e78-52c57c918a8f/bin-2019/utaipan/witness.graphml [2018-11-23 12:21:25,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:21:25,839 INFO L168 Benchmark]: Toolchain (without parser) took 17747.61 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 958.2 MB in the beginning and 1.9 GB in the end (delta: -898.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-23 12:21:25,840 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:21:25,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.23 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:25,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.95 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:21:25,841 INFO L168 Benchmark]: Boogie Preprocessor took 60.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:25,841 INFO L168 Benchmark]: RCFGBuilder took 262.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:25,841 INFO L168 Benchmark]: TraceAbstraction took 17184.79 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -772.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-23 12:21:25,842 INFO L168 Benchmark]: Witness Printer took 58.60 ms. Allocated memory is still 3.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 601.0 kB). Peak memory consumption was 601.0 kB. Max. memory is 11.5 GB. [2018-11-23 12:21:25,844 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.23 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.95 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 262.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17184.79 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -772.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 58.60 ms. Allocated memory is still 3.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 601.0 kB). Peak memory consumption was 601.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. SAFE Result, 17.1s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, 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: 7.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...