./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/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_8deee167-232d-43e2-8787-b28d2c322d83/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/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-5842f4b [2018-11-18 17:17:02,992 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:17:02,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:17:03,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:17:03,002 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:17:03,003 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:17:03,004 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:17:03,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:17:03,007 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:17:03,008 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:17:03,008 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:17:03,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:17:03,009 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:17:03,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:17:03,011 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:17:03,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:17:03,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:17:03,014 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:17:03,016 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:17:03,017 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:17:03,018 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:17:03,019 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:17:03,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:17:03,021 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:17:03,021 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:17:03,022 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:17:03,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:17:03,023 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:17:03,024 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:17:03,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:17:03,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:17:03,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:17:03,025 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:17:03,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:17:03,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:17:03,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:17:03,028 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 17:17:03,039 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:17:03,039 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:17:03,040 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:17:03,040 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:17:03,040 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:17:03,040 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:17:03,040 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:17:03,040 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:17:03,041 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:17:03,041 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:17:03,041 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:17:03,041 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:17:03,041 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:17:03,043 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:17:03,043 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:17:03,043 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:17:03,043 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:17:03,043 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:17:03,043 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:17:03,044 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:17:03,044 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:17:03,044 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:17:03,044 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:17:03,044 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:17:03,044 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:17:03,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:17:03,045 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:17:03,045 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:17:03,045 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:17:03,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:17:03,045 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:17:03,045 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:17:03,045 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:17:03,045 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:17:03,046 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:17:03,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:17:03,047 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:17:03,047 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_8deee167-232d-43e2-8787-b28d2c322d83/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-18 17:17:03,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:17:03,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:17:03,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:17:03,088 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:17:03,088 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:17:03,089 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 17:17:03,129 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/bin-2019/utaipan/data/c65ebaf0d/126f5da4f82e4b53a0e8fbe63d9911c4/FLAG72e6ef2b3 [2018-11-18 17:17:03,510 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:17:03,510 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 17:17:03,516 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/bin-2019/utaipan/data/c65ebaf0d/126f5da4f82e4b53a0e8fbe63d9911c4/FLAG72e6ef2b3 [2018-11-18 17:17:03,528 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/bin-2019/utaipan/data/c65ebaf0d/126f5da4f82e4b53a0e8fbe63d9911c4 [2018-11-18 17:17:03,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:17:03,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:17:03,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:17:03,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:17:03,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:17:03,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:17:03" (1/1) ... [2018-11-18 17:17:03,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6654e84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03, skipping insertion in model container [2018-11-18 17:17:03,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:17:03" (1/1) ... [2018-11-18 17:17:03,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:17:03,568 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:17:03,715 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:17:03,719 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:17:03,741 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:17:03,755 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:17:03,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03 WrapperNode [2018-11-18 17:17:03,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:17:03,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:17:03,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:17:03,757 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:17:03,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03" (1/1) ... [2018-11-18 17:17:03,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03" (1/1) ... [2018-11-18 17:17:03,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:17:03,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:17:03,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:17:03,774 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:17:03,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03" (1/1) ... [2018-11-18 17:17:03,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03" (1/1) ... [2018-11-18 17:17:03,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03" (1/1) ... [2018-11-18 17:17:03,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03" (1/1) ... [2018-11-18 17:17:03,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03" (1/1) ... [2018-11-18 17:17:03,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03" (1/1) ... [2018-11-18 17:17:03,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03" (1/1) ... [2018-11-18 17:17:03,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:17:03,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:17:03,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:17:03,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:17:03,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/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-18 17:17:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:17:03,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:17:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:17:03,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:17:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:17:03,892 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:17:04,182 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:17:04,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:17:04 BoogieIcfgContainer [2018-11-18 17:17:04,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:17:04,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:17:04,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:17:04,186 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:17:04,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:17:03" (1/3) ... [2018-11-18 17:17:04,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd07a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:17:04, skipping insertion in model container [2018-11-18 17:17:04,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:03" (2/3) ... [2018-11-18 17:17:04,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd07a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:17:04, skipping insertion in model container [2018-11-18 17:17:04,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:17:04" (3/3) ... [2018-11-18 17:17:04,188 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 17:17:04,194 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:17:04,199 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:17:04,212 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:17:04,238 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:17:04,238 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:17:04,239 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:17:04,239 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:17:04,239 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:17:04,239 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:17:04,239 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:17:04,239 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:17:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-18 17:17:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 17:17:04,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:04,260 INFO L375 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-18 17:17:04,262 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:04,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash 322166107, now seen corresponding path program 1 times [2018-11-18 17:17:04,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:04,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:04,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:04,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:04,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:04,393 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-18 17:17:04,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:04,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:04,398 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:04,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:04,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:04,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:04,414 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2018-11-18 17:17:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:04,462 INFO L93 Difference]: Finished difference Result 101 states and 176 transitions. [2018-11-18 17:17:04,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:04,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 17:17:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:04,471 INFO L225 Difference]: With dead ends: 101 [2018-11-18 17:17:04,471 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 17:17:04,473 INFO L604 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-18 17:17:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 17:17:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2018-11-18 17:17:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 17:17:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2018-11-18 17:17:04,504 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2018-11-18 17:17:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:04,505 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2018-11-18 17:17:04,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2018-11-18 17:17:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 17:17:04,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:04,506 INFO L375 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-18 17:17:04,506 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:04,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:04,506 INFO L82 PathProgramCache]: Analyzing trace with hash -957697571, now seen corresponding path program 1 times [2018-11-18 17:17:04,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:04,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:04,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:17:04,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:04,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:04,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:04,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:04,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:04,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:04,646 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand 3 states. [2018-11-18 17:17:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:04,680 INFO L93 Difference]: Finished difference Result 140 states and 255 transitions. [2018-11-18 17:17:04,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:04,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 17:17:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:04,682 INFO L225 Difference]: With dead ends: 140 [2018-11-18 17:17:04,683 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 17:17:04,684 INFO L604 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-18 17:17:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 17:17:04,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-18 17:17:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 17:17:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 151 transitions. [2018-11-18 17:17:04,692 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 151 transitions. Word has length 23 [2018-11-18 17:17:04,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:04,692 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 151 transitions. [2018-11-18 17:17:04,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 151 transitions. [2018-11-18 17:17:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 17:17:04,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:04,693 INFO L375 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-18 17:17:04,694 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:04,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:04,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1397427458, now seen corresponding path program 1 times [2018-11-18 17:17:04,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:04,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:04,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:04,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:04,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:17:04,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:04,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:04,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:04,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:04,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:04,744 INFO L87 Difference]: Start difference. First operand 84 states and 151 transitions. Second operand 3 states. [2018-11-18 17:17:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:04,793 INFO L93 Difference]: Finished difference Result 130 states and 229 transitions. [2018-11-18 17:17:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:04,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 17:17:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:04,794 INFO L225 Difference]: With dead ends: 130 [2018-11-18 17:17:04,794 INFO L226 Difference]: Without dead ends: 90 [2018-11-18 17:17:04,795 INFO L604 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-18 17:17:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-18 17:17:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-18 17:17:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 17:17:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 154 transitions. [2018-11-18 17:17:04,803 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 154 transitions. Word has length 24 [2018-11-18 17:17:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:04,804 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 154 transitions. [2018-11-18 17:17:04,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 154 transitions. [2018-11-18 17:17:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 17:17:04,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:04,805 INFO L375 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-18 17:17:04,805 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:04,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash 376359104, now seen corresponding path program 1 times [2018-11-18 17:17:04,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:04,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:04,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:04,844 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-18 17:17:04,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:04,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:04,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:04,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:04,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:04,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:04,845 INFO L87 Difference]: Start difference. First operand 88 states and 154 transitions. Second operand 3 states. [2018-11-18 17:17:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:04,883 INFO L93 Difference]: Finished difference Result 165 states and 293 transitions. [2018-11-18 17:17:04,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:04,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 17:17:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:04,888 INFO L225 Difference]: With dead ends: 165 [2018-11-18 17:17:04,888 INFO L226 Difference]: Without dead ends: 163 [2018-11-18 17:17:04,888 INFO L604 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-18 17:17:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-18 17:17:04,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 115. [2018-11-18 17:17:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 17:17:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 203 transitions. [2018-11-18 17:17:04,900 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 203 transitions. Word has length 24 [2018-11-18 17:17:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:04,900 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 203 transitions. [2018-11-18 17:17:04,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:04,900 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 203 transitions. [2018-11-18 17:17:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 17:17:04,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:04,901 INFO L375 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-18 17:17:04,901 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:04,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:04,901 INFO L82 PathProgramCache]: Analyzing trace with hash -903504574, now seen corresponding path program 1 times [2018-11-18 17:17:04,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:04,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:04,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:04,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:04,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:04,958 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-18 17:17:04,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:04,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:04,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:04,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:04,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:04,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:04,959 INFO L87 Difference]: Start difference. First operand 115 states and 203 transitions. Second operand 3 states. [2018-11-18 17:17:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:04,990 INFO L93 Difference]: Finished difference Result 271 states and 485 transitions. [2018-11-18 17:17:04,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:04,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 17:17:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:04,992 INFO L225 Difference]: With dead ends: 271 [2018-11-18 17:17:04,992 INFO L226 Difference]: Without dead ends: 165 [2018-11-18 17:17:04,992 INFO L604 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-18 17:17:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-18 17:17:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-11-18 17:17:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-18 17:17:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 287 transitions. [2018-11-18 17:17:05,005 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 287 transitions. Word has length 24 [2018-11-18 17:17:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:05,005 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 287 transitions. [2018-11-18 17:17:05,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 287 transitions. [2018-11-18 17:17:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 17:17:05,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:05,009 INFO L375 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-18 17:17:05,010 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:05,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:05,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1217556590, now seen corresponding path program 1 times [2018-11-18 17:17:05,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:05,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:05,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:17:05,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:05,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:05,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:05,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:05,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:05,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:05,056 INFO L87 Difference]: Start difference. First operand 163 states and 287 transitions. Second operand 3 states. [2018-11-18 17:17:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:05,083 INFO L93 Difference]: Finished difference Result 244 states and 428 transitions. [2018-11-18 17:17:05,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:05,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 17:17:05,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:05,085 INFO L225 Difference]: With dead ends: 244 [2018-11-18 17:17:05,085 INFO L226 Difference]: Without dead ends: 167 [2018-11-18 17:17:05,085 INFO L604 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-18 17:17:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-18 17:17:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-18 17:17:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-18 17:17:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 287 transitions. [2018-11-18 17:17:05,095 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 287 transitions. Word has length 25 [2018-11-18 17:17:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:05,095 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 287 transitions. [2018-11-18 17:17:05,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 287 transitions. [2018-11-18 17:17:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 17:17:05,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:05,096 INFO L375 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-18 17:17:05,096 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:05,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:05,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2056342352, now seen corresponding path program 1 times [2018-11-18 17:17:05,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:05,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:05,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:05,143 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-18 17:17:05,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:05,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:05,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:05,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:05,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:05,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:05,144 INFO L87 Difference]: Start difference. First operand 165 states and 287 transitions. Second operand 3 states. [2018-11-18 17:17:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:05,166 INFO L93 Difference]: Finished difference Result 309 states and 545 transitions. [2018-11-18 17:17:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:05,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 17:17:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:05,168 INFO L225 Difference]: With dead ends: 309 [2018-11-18 17:17:05,168 INFO L226 Difference]: Without dead ends: 307 [2018-11-18 17:17:05,169 INFO L604 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-18 17:17:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-18 17:17:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 221. [2018-11-18 17:17:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-18 17:17:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 383 transitions. [2018-11-18 17:17:05,178 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 383 transitions. Word has length 25 [2018-11-18 17:17:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:05,178 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 383 transitions. [2018-11-18 17:17:05,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:05,179 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 383 transitions. [2018-11-18 17:17:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 17:17:05,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:05,180 INFO L375 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-18 17:17:05,180 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:05,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash 776478674, now seen corresponding path program 1 times [2018-11-18 17:17:05,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:05,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:05,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:17:05,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:05,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:05,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:05,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:05,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:05,214 INFO L87 Difference]: Start difference. First operand 221 states and 383 transitions. Second operand 3 states. [2018-11-18 17:17:05,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:05,238 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2018-11-18 17:17:05,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:05,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 17:17:05,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:05,240 INFO L225 Difference]: With dead ends: 525 [2018-11-18 17:17:05,240 INFO L226 Difference]: Without dead ends: 315 [2018-11-18 17:17:05,240 INFO L604 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-18 17:17:05,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-18 17:17:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2018-11-18 17:17:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-18 17:17:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 539 transitions. [2018-11-18 17:17:05,253 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 539 transitions. Word has length 25 [2018-11-18 17:17:05,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:05,254 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 539 transitions. [2018-11-18 17:17:05,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 539 transitions. [2018-11-18 17:17:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 17:17:05,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:05,259 INFO L375 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-18 17:17:05,259 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:05,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:05,259 INFO L82 PathProgramCache]: Analyzing trace with hash -677683113, now seen corresponding path program 1 times [2018-11-18 17:17:05,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:05,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:05,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:05,295 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-18 17:17:05,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:05,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:05,295 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:05,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:05,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:05,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:05,296 INFO L87 Difference]: Start difference. First operand 313 states and 539 transitions. Second operand 3 states. [2018-11-18 17:17:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:05,330 INFO L93 Difference]: Finished difference Result 469 states and 805 transitions. [2018-11-18 17:17:05,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:05,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 17:17:05,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:05,335 INFO L225 Difference]: With dead ends: 469 [2018-11-18 17:17:05,335 INFO L226 Difference]: Without dead ends: 319 [2018-11-18 17:17:05,339 INFO L604 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-18 17:17:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-18 17:17:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-11-18 17:17:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-18 17:17:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 539 transitions. [2018-11-18 17:17:05,348 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 539 transitions. Word has length 26 [2018-11-18 17:17:05,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:05,349 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 539 transitions. [2018-11-18 17:17:05,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 539 transitions. [2018-11-18 17:17:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 17:17:05,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:05,350 INFO L375 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-18 17:17:05,350 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:05,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:05,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1698751467, now seen corresponding path program 1 times [2018-11-18 17:17:05,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:05,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:05,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:05,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-18 17:17:05,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:05,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:05,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:05,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:05,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:05,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:05,373 INFO L87 Difference]: Start difference. First operand 317 states and 539 transitions. Second operand 3 states. [2018-11-18 17:17:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:05,457 INFO L93 Difference]: Finished difference Result 589 states and 1017 transitions. [2018-11-18 17:17:05,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:05,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 17:17:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:05,460 INFO L225 Difference]: With dead ends: 589 [2018-11-18 17:17:05,460 INFO L226 Difference]: Without dead ends: 587 [2018-11-18 17:17:05,461 INFO L604 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-18 17:17:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-18 17:17:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 433. [2018-11-18 17:17:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-11-18 17:17:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 727 transitions. [2018-11-18 17:17:05,477 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 727 transitions. Word has length 26 [2018-11-18 17:17:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:05,477 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 727 transitions. [2018-11-18 17:17:05,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 727 transitions. [2018-11-18 17:17:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 17:17:05,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:05,478 INFO L375 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-18 17:17:05,478 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:05,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1316352151, now seen corresponding path program 1 times [2018-11-18 17:17:05,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:05,508 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-18 17:17:05,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:05,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:05,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:05,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:05,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:05,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:05,509 INFO L87 Difference]: Start difference. First operand 433 states and 727 transitions. Second operand 3 states. [2018-11-18 17:17:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:05,584 INFO L93 Difference]: Finished difference Result 1029 states and 1737 transitions. [2018-11-18 17:17:05,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:05,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 17:17:05,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:05,587 INFO L225 Difference]: With dead ends: 1029 [2018-11-18 17:17:05,587 INFO L226 Difference]: Without dead ends: 611 [2018-11-18 17:17:05,588 INFO L604 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-18 17:17:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-11-18 17:17:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2018-11-18 17:17:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-18 17:17:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1015 transitions. [2018-11-18 17:17:05,604 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1015 transitions. Word has length 26 [2018-11-18 17:17:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:05,604 INFO L480 AbstractCegarLoop]: Abstraction has 609 states and 1015 transitions. [2018-11-18 17:17:05,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1015 transitions. [2018-11-18 17:17:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 17:17:05,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:05,605 INFO L375 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-18 17:17:05,605 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:05,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:05,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1121474169, now seen corresponding path program 1 times [2018-11-18 17:17:05,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:05,672 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-18 17:17:05,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:05,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:05,673 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:05,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:05,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:05,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:05,673 INFO L87 Difference]: Start difference. First operand 609 states and 1015 transitions. Second operand 3 states. [2018-11-18 17:17:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:05,763 INFO L93 Difference]: Finished difference Result 913 states and 1517 transitions. [2018-11-18 17:17:05,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:05,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 17:17:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:05,765 INFO L225 Difference]: With dead ends: 913 [2018-11-18 17:17:05,766 INFO L226 Difference]: Without dead ends: 619 [2018-11-18 17:17:05,766 INFO L604 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-18 17:17:05,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-18 17:17:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2018-11-18 17:17:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-18 17:17:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1015 transitions. [2018-11-18 17:17:05,785 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1015 transitions. Word has length 27 [2018-11-18 17:17:05,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:05,785 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 1015 transitions. [2018-11-18 17:17:05,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1015 transitions. [2018-11-18 17:17:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 17:17:05,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:05,788 INFO L375 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-18 17:17:05,788 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:05,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:05,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2142542523, now seen corresponding path program 1 times [2018-11-18 17:17:05,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:05,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:05,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:05,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:05,875 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-18 17:17:05,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:05,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:05,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:05,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:05,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:05,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:05,876 INFO L87 Difference]: Start difference. First operand 617 states and 1015 transitions. Second operand 3 states. [2018-11-18 17:17:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:06,017 INFO L93 Difference]: Finished difference Result 1789 states and 2937 transitions. [2018-11-18 17:17:06,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:06,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 17:17:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:06,020 INFO L225 Difference]: With dead ends: 1789 [2018-11-18 17:17:06,021 INFO L226 Difference]: Without dead ends: 1195 [2018-11-18 17:17:06,022 INFO L604 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-18 17:17:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-11-18 17:17:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1193. [2018-11-18 17:17:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-11-18 17:17:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1927 transitions. [2018-11-18 17:17:06,054 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1927 transitions. Word has length 27 [2018-11-18 17:17:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:06,054 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1927 transitions. [2018-11-18 17:17:06,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1927 transitions. [2018-11-18 17:17:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 17:17:06,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:06,056 INFO L375 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-18 17:17:06,056 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:06,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:06,057 INFO L82 PathProgramCache]: Analyzing trace with hash -862678845, now seen corresponding path program 1 times [2018-11-18 17:17:06,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:06,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:06,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:06,110 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-18 17:17:06,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:06,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:06,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:06,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:06,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:06,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:06,111 INFO L87 Difference]: Start difference. First operand 1193 states and 1927 transitions. Second operand 3 states. [2018-11-18 17:17:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:06,197 INFO L93 Difference]: Finished difference Result 1469 states and 2425 transitions. [2018-11-18 17:17:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:06,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 17:17:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:06,202 INFO L225 Difference]: With dead ends: 1469 [2018-11-18 17:17:06,202 INFO L226 Difference]: Without dead ends: 1467 [2018-11-18 17:17:06,203 INFO L604 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-18 17:17:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-11-18 17:17:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1193. [2018-11-18 17:17:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-11-18 17:17:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1911 transitions. [2018-11-18 17:17:06,240 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1911 transitions. Word has length 27 [2018-11-18 17:17:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:06,240 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1911 transitions. [2018-11-18 17:17:06,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1911 transitions. [2018-11-18 17:17:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 17:17:06,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:06,242 INFO L375 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-18 17:17:06,242 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:06,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:06,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1994094676, now seen corresponding path program 1 times [2018-11-18 17:17:06,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:06,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:06,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:06,335 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-18 17:17:06,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:06,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:06,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:06,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:06,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:06,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:06,336 INFO L87 Difference]: Start difference. First operand 1193 states and 1911 transitions. Second operand 3 states. [2018-11-18 17:17:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:06,471 INFO L93 Difference]: Finished difference Result 2173 states and 3545 transitions. [2018-11-18 17:17:06,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:06,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 17:17:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:06,479 INFO L225 Difference]: With dead ends: 2173 [2018-11-18 17:17:06,480 INFO L226 Difference]: Without dead ends: 2171 [2018-11-18 17:17:06,481 INFO L604 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-18 17:17:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2018-11-18 17:17:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1689. [2018-11-18 17:17:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2018-11-18 17:17:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2647 transitions. [2018-11-18 17:17:06,530 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2647 transitions. Word has length 28 [2018-11-18 17:17:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:06,531 INFO L480 AbstractCegarLoop]: Abstraction has 1689 states and 2647 transitions. [2018-11-18 17:17:06,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2647 transitions. [2018-11-18 17:17:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 17:17:06,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:06,533 INFO L375 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-18 17:17:06,533 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:06,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:06,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1021008942, now seen corresponding path program 1 times [2018-11-18 17:17:06,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:06,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:06,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:06,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:06,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:06,619 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-18 17:17:06,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:06,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:06,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:06,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:06,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:06,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:06,620 INFO L87 Difference]: Start difference. First operand 1689 states and 2647 transitions. Second operand 3 states. [2018-11-18 17:17:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:06,782 INFO L93 Difference]: Finished difference Result 3997 states and 6297 transitions. [2018-11-18 17:17:06,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:06,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 17:17:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:06,788 INFO L225 Difference]: With dead ends: 3997 [2018-11-18 17:17:06,789 INFO L226 Difference]: Without dead ends: 2331 [2018-11-18 17:17:06,791 INFO L604 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-18 17:17:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2018-11-18 17:17:06,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2329. [2018-11-18 17:17:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2329 states. [2018-11-18 17:17:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3623 transitions. [2018-11-18 17:17:06,872 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3623 transitions. Word has length 28 [2018-11-18 17:17:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:06,872 INFO L480 AbstractCegarLoop]: Abstraction has 2329 states and 3623 transitions. [2018-11-18 17:17:06,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3623 transitions. [2018-11-18 17:17:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 17:17:06,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:06,875 INFO L375 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-18 17:17:06,875 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:06,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:06,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1687178374, now seen corresponding path program 1 times [2018-11-18 17:17:06,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:06,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:06,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:06,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:06,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:17:06,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:06,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:06,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:06,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:06,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:06,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:06,961 INFO L87 Difference]: Start difference. First operand 2329 states and 3623 transitions. Second operand 3 states. [2018-11-18 17:17:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:07,090 INFO L93 Difference]: Finished difference Result 3517 states and 5465 transitions. [2018-11-18 17:17:07,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:07,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 17:17:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:07,097 INFO L225 Difference]: With dead ends: 3517 [2018-11-18 17:17:07,097 INFO L226 Difference]: Without dead ends: 2379 [2018-11-18 17:17:07,100 INFO L604 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-18 17:17:07,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2018-11-18 17:17:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2377. [2018-11-18 17:17:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-18 17:17:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3655 transitions. [2018-11-18 17:17:07,189 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3655 transitions. Word has length 29 [2018-11-18 17:17:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:07,190 INFO L480 AbstractCegarLoop]: Abstraction has 2377 states and 3655 transitions. [2018-11-18 17:17:07,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3655 transitions. [2018-11-18 17:17:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 17:17:07,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:07,194 INFO L375 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-18 17:17:07,194 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:07,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:07,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1586720568, now seen corresponding path program 1 times [2018-11-18 17:17:07,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:07,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:07,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:07,263 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-18 17:17:07,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:07,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:07,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:07,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:07,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:07,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:07,264 INFO L87 Difference]: Start difference. First operand 2377 states and 3655 transitions. Second operand 3 states. [2018-11-18 17:17:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:07,367 INFO L93 Difference]: Finished difference Result 4237 states and 6633 transitions. [2018-11-18 17:17:07,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:07,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 17:17:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:07,378 INFO L225 Difference]: With dead ends: 4237 [2018-11-18 17:17:07,379 INFO L226 Difference]: Without dead ends: 4235 [2018-11-18 17:17:07,380 INFO L604 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-18 17:17:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-11-18 17:17:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 3401. [2018-11-18 17:17:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2018-11-18 17:17:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 5095 transitions. [2018-11-18 17:17:07,452 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 5095 transitions. Word has length 29 [2018-11-18 17:17:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:07,452 INFO L480 AbstractCegarLoop]: Abstraction has 3401 states and 5095 transitions. [2018-11-18 17:17:07,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 5095 transitions. [2018-11-18 17:17:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 17:17:07,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:07,456 INFO L375 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-18 17:17:07,457 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:07,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:07,457 INFO L82 PathProgramCache]: Analyzing trace with hash 306856890, now seen corresponding path program 1 times [2018-11-18 17:17:07,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:07,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:07,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:07,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:07,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:07,527 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-18 17:17:07,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:07,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:07,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:07,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:07,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:07,528 INFO L87 Difference]: Start difference. First operand 3401 states and 5095 transitions. Second operand 3 states. [2018-11-18 17:17:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:07,695 INFO L93 Difference]: Finished difference Result 7949 states and 11945 transitions. [2018-11-18 17:17:07,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:07,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 17:17:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:07,708 INFO L225 Difference]: With dead ends: 7949 [2018-11-18 17:17:07,709 INFO L226 Difference]: Without dead ends: 4619 [2018-11-18 17:17:07,713 INFO L604 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-18 17:17:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-18 17:17:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4617. [2018-11-18 17:17:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4617 states. [2018-11-18 17:17:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 6855 transitions. [2018-11-18 17:17:07,819 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 6855 transitions. Word has length 29 [2018-11-18 17:17:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:07,819 INFO L480 AbstractCegarLoop]: Abstraction has 4617 states and 6855 transitions. [2018-11-18 17:17:07,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 6855 transitions. [2018-11-18 17:17:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:17:07,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:07,823 INFO L375 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-18 17:17:07,823 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:07,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:07,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1943912131, now seen corresponding path program 1 times [2018-11-18 17:17:07,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:07,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:07,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:07,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:07,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:07,887 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-18 17:17:07,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:07,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:07,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:07,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:07,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:07,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:07,888 INFO L87 Difference]: Start difference. First operand 4617 states and 6855 transitions. Second operand 3 states. [2018-11-18 17:17:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:08,022 INFO L93 Difference]: Finished difference Result 6925 states and 10249 transitions. [2018-11-18 17:17:08,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:08,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 17:17:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:08,038 INFO L225 Difference]: With dead ends: 6925 [2018-11-18 17:17:08,038 INFO L226 Difference]: Without dead ends: 4683 [2018-11-18 17:17:08,042 INFO L604 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-18 17:17:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2018-11-18 17:17:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 4681. [2018-11-18 17:17:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4681 states. [2018-11-18 17:17:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 6855 transitions. [2018-11-18 17:17:08,139 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 6855 transitions. Word has length 30 [2018-11-18 17:17:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:08,139 INFO L480 AbstractCegarLoop]: Abstraction has 4681 states and 6855 transitions. [2018-11-18 17:17:08,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 6855 transitions. [2018-11-18 17:17:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:17:08,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:08,144 INFO L375 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-18 17:17:08,145 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:08,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:08,145 INFO L82 PathProgramCache]: Analyzing trace with hash 922843777, now seen corresponding path program 1 times [2018-11-18 17:17:08,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:08,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:08,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:08,203 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-18 17:17:08,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:08,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:08,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:08,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:08,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:08,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:08,204 INFO L87 Difference]: Start difference. First operand 4681 states and 6855 transitions. Second operand 3 states. [2018-11-18 17:17:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:08,369 INFO L93 Difference]: Finished difference Result 8205 states and 12233 transitions. [2018-11-18 17:17:08,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:08,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 17:17:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:08,383 INFO L225 Difference]: With dead ends: 8205 [2018-11-18 17:17:08,384 INFO L226 Difference]: Without dead ends: 8203 [2018-11-18 17:17:08,387 INFO L604 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-18 17:17:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2018-11-18 17:17:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 6793. [2018-11-18 17:17:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-11-18 17:17:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 9671 transitions. [2018-11-18 17:17:08,505 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 9671 transitions. Word has length 30 [2018-11-18 17:17:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:08,505 INFO L480 AbstractCegarLoop]: Abstraction has 6793 states and 9671 transitions. [2018-11-18 17:17:08,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 9671 transitions. [2018-11-18 17:17:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:17:08,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:08,514 INFO L375 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-18 17:17:08,514 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:08,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:08,514 INFO L82 PathProgramCache]: Analyzing trace with hash -357019901, now seen corresponding path program 1 times [2018-11-18 17:17:08,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:08,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:08,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:08,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:08,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:08,587 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-18 17:17:08,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:08,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:08,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:08,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:08,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:08,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:08,588 INFO L87 Difference]: Start difference. First operand 6793 states and 9671 transitions. Second operand 3 states. [2018-11-18 17:17:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:08,798 INFO L93 Difference]: Finished difference Result 15757 states and 22473 transitions. [2018-11-18 17:17:08,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:08,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 17:17:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:08,817 INFO L225 Difference]: With dead ends: 15757 [2018-11-18 17:17:08,817 INFO L226 Difference]: Without dead ends: 9099 [2018-11-18 17:17:08,828 INFO L604 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-18 17:17:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9099 states. [2018-11-18 17:17:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 9097. [2018-11-18 17:17:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9097 states. [2018-11-18 17:17:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9097 states to 9097 states and 12807 transitions. [2018-11-18 17:17:09,027 INFO L78 Accepts]: Start accepts. Automaton has 9097 states and 12807 transitions. Word has length 30 [2018-11-18 17:17:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:09,027 INFO L480 AbstractCegarLoop]: Abstraction has 9097 states and 12807 transitions. [2018-11-18 17:17:09,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 9097 states and 12807 transitions. [2018-11-18 17:17:09,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 17:17:09,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:09,035 INFO L375 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-18 17:17:09,035 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:09,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:09,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1456398865, now seen corresponding path program 1 times [2018-11-18 17:17:09,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:09,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:09,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:09,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:09,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:09,096 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-18 17:17:09,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:09,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:09,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:09,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:09,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:09,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:09,097 INFO L87 Difference]: Start difference. First operand 9097 states and 12807 transitions. Second operand 3 states. [2018-11-18 17:17:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:09,203 INFO L93 Difference]: Finished difference Result 13645 states and 19145 transitions. [2018-11-18 17:17:09,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:09,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 17:17:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:09,218 INFO L225 Difference]: With dead ends: 13645 [2018-11-18 17:17:09,218 INFO L226 Difference]: Without dead ends: 9227 [2018-11-18 17:17:09,224 INFO L604 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-18 17:17:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2018-11-18 17:17:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 9225. [2018-11-18 17:17:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2018-11-18 17:17:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 12807 transitions. [2018-11-18 17:17:09,403 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 12807 transitions. Word has length 31 [2018-11-18 17:17:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:09,403 INFO L480 AbstractCegarLoop]: Abstraction has 9225 states and 12807 transitions. [2018-11-18 17:17:09,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 12807 transitions. [2018-11-18 17:17:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 17:17:09,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:09,409 INFO L375 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-18 17:17:09,409 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:09,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1817500077, now seen corresponding path program 1 times [2018-11-18 17:17:09,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:09,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:09,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:09,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:09,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:09,479 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-18 17:17:09,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:09,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:09,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:09,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:09,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:09,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:09,480 INFO L87 Difference]: Start difference. First operand 9225 states and 12807 transitions. Second operand 3 states. [2018-11-18 17:17:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:09,654 INFO L93 Difference]: Finished difference Result 15885 states and 22409 transitions. [2018-11-18 17:17:09,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:09,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 17:17:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:09,677 INFO L225 Difference]: With dead ends: 15885 [2018-11-18 17:17:09,677 INFO L226 Difference]: Without dead ends: 15883 [2018-11-18 17:17:09,682 INFO L604 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-18 17:17:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2018-11-18 17:17:09,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 13577. [2018-11-18 17:17:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13577 states. [2018-11-18 17:17:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 18311 transitions. [2018-11-18 17:17:09,903 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 18311 transitions. Word has length 31 [2018-11-18 17:17:09,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:09,903 INFO L480 AbstractCegarLoop]: Abstraction has 13577 states and 18311 transitions. [2018-11-18 17:17:09,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 18311 transitions. [2018-11-18 17:17:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 17:17:09,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:09,916 INFO L375 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-18 17:17:09,916 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:09,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash 537636399, now seen corresponding path program 1 times [2018-11-18 17:17:09,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:09,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:09,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:10,003 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-18 17:17:10,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:10,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:10,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:10,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:10,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:10,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:10,004 INFO L87 Difference]: Start difference. First operand 13577 states and 18311 transitions. Second operand 3 states. [2018-11-18 17:17:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:10,374 INFO L93 Difference]: Finished difference Result 31245 states and 42121 transitions. [2018-11-18 17:17:10,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:10,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 17:17:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:10,397 INFO L225 Difference]: With dead ends: 31245 [2018-11-18 17:17:10,397 INFO L226 Difference]: Without dead ends: 17931 [2018-11-18 17:17:10,411 INFO L604 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-18 17:17:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17931 states. [2018-11-18 17:17:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17931 to 17929. [2018-11-18 17:17:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17929 states. [2018-11-18 17:17:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17929 states to 17929 states and 23815 transitions. [2018-11-18 17:17:10,682 INFO L78 Accepts]: Start accepts. Automaton has 17929 states and 23815 transitions. Word has length 31 [2018-11-18 17:17:10,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:10,682 INFO L480 AbstractCegarLoop]: Abstraction has 17929 states and 23815 transitions. [2018-11-18 17:17:10,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 17929 states and 23815 transitions. [2018-11-18 17:17:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 17:17:10,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:10,689 INFO L375 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-18 17:17:10,689 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:10,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:10,689 INFO L82 PathProgramCache]: Analyzing trace with hash 508143000, now seen corresponding path program 1 times [2018-11-18 17:17:10,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:10,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:10,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:10,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:10,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:17:10,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:10,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:10,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:10,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:10,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:10,746 INFO L87 Difference]: Start difference. First operand 17929 states and 23815 transitions. Second operand 3 states. [2018-11-18 17:17:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:10,988 INFO L93 Difference]: Finished difference Result 26893 states and 35593 transitions. [2018-11-18 17:17:10,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:10,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 17:17:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:11,004 INFO L225 Difference]: With dead ends: 26893 [2018-11-18 17:17:11,005 INFO L226 Difference]: Without dead ends: 18187 [2018-11-18 17:17:11,018 INFO L604 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-18 17:17:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18187 states. [2018-11-18 17:17:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18187 to 18185. [2018-11-18 17:17:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18185 states. [2018-11-18 17:17:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18185 states to 18185 states and 23815 transitions. [2018-11-18 17:17:11,348 INFO L78 Accepts]: Start accepts. Automaton has 18185 states and 23815 transitions. Word has length 32 [2018-11-18 17:17:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:11,348 INFO L480 AbstractCegarLoop]: Abstraction has 18185 states and 23815 transitions. [2018-11-18 17:17:11,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 18185 states and 23815 transitions. [2018-11-18 17:17:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 17:17:11,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:11,355 INFO L375 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-18 17:17:11,355 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:11,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:11,356 INFO L82 PathProgramCache]: Analyzing trace with hash -512925354, now seen corresponding path program 1 times [2018-11-18 17:17:11,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:11,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:11,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:11,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:11,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:11,394 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-18 17:17:11,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:11,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:11,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:11,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:11,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:11,395 INFO L87 Difference]: Start difference. First operand 18185 states and 23815 transitions. Second operand 3 states. [2018-11-18 17:17:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:11,631 INFO L93 Difference]: Finished difference Result 30733 states and 40713 transitions. [2018-11-18 17:17:11,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:11,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 17:17:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:11,654 INFO L225 Difference]: With dead ends: 30733 [2018-11-18 17:17:11,654 INFO L226 Difference]: Without dead ends: 30731 [2018-11-18 17:17:11,660 INFO L604 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-18 17:17:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30731 states. [2018-11-18 17:17:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30731 to 27145. [2018-11-18 17:17:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27145 states. [2018-11-18 17:17:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27145 states to 27145 states and 34567 transitions. [2018-11-18 17:17:12,013 INFO L78 Accepts]: Start accepts. Automaton has 27145 states and 34567 transitions. Word has length 32 [2018-11-18 17:17:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:12,013 INFO L480 AbstractCegarLoop]: Abstraction has 27145 states and 34567 transitions. [2018-11-18 17:17:12,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 27145 states and 34567 transitions. [2018-11-18 17:17:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 17:17:12,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:12,030 INFO L375 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-18 17:17:12,031 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:12,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:12,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1792789032, now seen corresponding path program 1 times [2018-11-18 17:17:12,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:12,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:12,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:12,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:12,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:17:12,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:12,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:12,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:12,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:12,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:12,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:12,093 INFO L87 Difference]: Start difference. First operand 27145 states and 34567 transitions. Second operand 3 states. [2018-11-18 17:17:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:12,485 INFO L93 Difference]: Finished difference Result 61965 states and 78601 transitions. [2018-11-18 17:17:12,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:12,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 17:17:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:12,507 INFO L225 Difference]: With dead ends: 61965 [2018-11-18 17:17:12,507 INFO L226 Difference]: Without dead ends: 35339 [2018-11-18 17:17:12,526 INFO L604 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-18 17:17:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35339 states. [2018-11-18 17:17:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35339 to 35337. [2018-11-18 17:17:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35337 states. [2018-11-18 17:17:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35337 states to 35337 states and 44039 transitions. [2018-11-18 17:17:13,070 INFO L78 Accepts]: Start accepts. Automaton has 35337 states and 44039 transitions. Word has length 32 [2018-11-18 17:17:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:13,070 INFO L480 AbstractCegarLoop]: Abstraction has 35337 states and 44039 transitions. [2018-11-18 17:17:13,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 35337 states and 44039 transitions. [2018-11-18 17:17:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 17:17:13,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:13,087 INFO L375 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-18 17:17:13,087 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:13,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:13,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1279399012, now seen corresponding path program 1 times [2018-11-18 17:17:13,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:13,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:13,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:13,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:13,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:13,150 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-18 17:17:13,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:13,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:13,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:13,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:13,151 INFO L87 Difference]: Start difference. First operand 35337 states and 44039 transitions. Second operand 3 states. [2018-11-18 17:17:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:13,613 INFO L93 Difference]: Finished difference Result 53005 states and 65801 transitions. [2018-11-18 17:17:13,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:13,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 17:17:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:13,637 INFO L225 Difference]: With dead ends: 53005 [2018-11-18 17:17:13,637 INFO L226 Difference]: Without dead ends: 35851 [2018-11-18 17:17:13,648 INFO L604 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-18 17:17:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35851 states. [2018-11-18 17:17:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35851 to 35849. [2018-11-18 17:17:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35849 states. [2018-11-18 17:17:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35849 states to 35849 states and 44039 transitions. [2018-11-18 17:17:14,074 INFO L78 Accepts]: Start accepts. Automaton has 35849 states and 44039 transitions. Word has length 33 [2018-11-18 17:17:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:14,074 INFO L480 AbstractCegarLoop]: Abstraction has 35849 states and 44039 transitions. [2018-11-18 17:17:14,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 35849 states and 44039 transitions. [2018-11-18 17:17:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 17:17:14,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:14,086 INFO L375 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-18 17:17:14,086 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:14,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:14,086 INFO L82 PathProgramCache]: Analyzing trace with hash 258330658, now seen corresponding path program 1 times [2018-11-18 17:17:14,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:14,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:14,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:14,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:14,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:14,141 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-18 17:17:14,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:14,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:14,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:14,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:14,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:14,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:14,142 INFO L87 Difference]: Start difference. First operand 35849 states and 44039 transitions. Second operand 3 states. [2018-11-18 17:17:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:14,797 INFO L93 Difference]: Finished difference Result 59405 states and 73225 transitions. [2018-11-18 17:17:14,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:14,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 17:17:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:14,827 INFO L225 Difference]: With dead ends: 59405 [2018-11-18 17:17:14,827 INFO L226 Difference]: Without dead ends: 59403 [2018-11-18 17:17:14,831 INFO L604 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-18 17:17:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59403 states. [2018-11-18 17:17:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59403 to 54281. [2018-11-18 17:17:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54281 states. [2018-11-18 17:17:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54281 states to 54281 states and 65031 transitions. [2018-11-18 17:17:15,384 INFO L78 Accepts]: Start accepts. Automaton has 54281 states and 65031 transitions. Word has length 33 [2018-11-18 17:17:15,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:15,384 INFO L480 AbstractCegarLoop]: Abstraction has 54281 states and 65031 transitions. [2018-11-18 17:17:15,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 54281 states and 65031 transitions. [2018-11-18 17:17:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 17:17:15,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:15,416 INFO L375 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-18 17:17:15,416 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:15,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:15,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1021533020, now seen corresponding path program 1 times [2018-11-18 17:17:15,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:15,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:15,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:15,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:15,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:15,467 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-18 17:17:15,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:15,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:15,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:15,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:15,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:15,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:15,468 INFO L87 Difference]: Start difference. First operand 54281 states and 65031 transitions. Second operand 3 states. [2018-11-18 17:17:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:16,200 INFO L93 Difference]: Finished difference Result 122893 states and 145929 transitions. [2018-11-18 17:17:16,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:16,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 17:17:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:16,248 INFO L225 Difference]: With dead ends: 122893 [2018-11-18 17:17:16,248 INFO L226 Difference]: Without dead ends: 69643 [2018-11-18 17:17:16,276 INFO L604 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-18 17:17:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69643 states. [2018-11-18 17:17:17,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69643 to 69641. [2018-11-18 17:17:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69641 states. [2018-11-18 17:17:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69641 states to 69641 states and 80903 transitions. [2018-11-18 17:17:17,194 INFO L78 Accepts]: Start accepts. Automaton has 69641 states and 80903 transitions. Word has length 33 [2018-11-18 17:17:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:17,194 INFO L480 AbstractCegarLoop]: Abstraction has 69641 states and 80903 transitions. [2018-11-18 17:17:17,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 69641 states and 80903 transitions. [2018-11-18 17:17:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 17:17:17,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:17,220 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:17:17,220 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:17,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash -581468051, now seen corresponding path program 1 times [2018-11-18 17:17:17,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:17,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:17,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:17,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:17,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:17,239 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-18 17:17:17,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:17,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:17,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:17,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:17,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:17,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:17,240 INFO L87 Difference]: Start difference. First operand 69641 states and 80903 transitions. Second operand 3 states. [2018-11-18 17:17:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:18,073 INFO L93 Difference]: Finished difference Result 104461 states and 120841 transitions. [2018-11-18 17:17:18,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:18,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 17:17:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:18,120 INFO L225 Difference]: With dead ends: 104461 [2018-11-18 17:17:18,120 INFO L226 Difference]: Without dead ends: 70667 [2018-11-18 17:17:18,141 INFO L604 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-18 17:17:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70667 states. [2018-11-18 17:17:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70667 to 70665. [2018-11-18 17:17:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70665 states. [2018-11-18 17:17:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70665 states to 70665 states and 80903 transitions. [2018-11-18 17:17:19,148 INFO L78 Accepts]: Start accepts. Automaton has 70665 states and 80903 transitions. Word has length 34 [2018-11-18 17:17:19,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:19,148 INFO L480 AbstractCegarLoop]: Abstraction has 70665 states and 80903 transitions. [2018-11-18 17:17:19,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 70665 states and 80903 transitions. [2018-11-18 17:17:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 17:17:19,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:19,175 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:17:19,175 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:19,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:19,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1602536405, now seen corresponding path program 1 times [2018-11-18 17:17:19,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:19,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:19,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:19,208 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-18 17:17:19,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:19,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:19,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:19,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:19,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:19,209 INFO L87 Difference]: Start difference. First operand 70665 states and 80903 transitions. Second operand 3 states. [2018-11-18 17:17:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:20,356 INFO L93 Difference]: Finished difference Result 114699 states and 130056 transitions. [2018-11-18 17:17:20,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:20,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 17:17:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:20,439 INFO L225 Difference]: With dead ends: 114699 [2018-11-18 17:17:20,439 INFO L226 Difference]: Without dead ends: 114697 [2018-11-18 17:17:20,451 INFO L604 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-18 17:17:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114697 states. [2018-11-18 17:17:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114697 to 108553. [2018-11-18 17:17:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108553 states. [2018-11-18 17:17:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108553 states to 108553 states and 121863 transitions. [2018-11-18 17:17:21,564 INFO L78 Accepts]: Start accepts. Automaton has 108553 states and 121863 transitions. Word has length 34 [2018-11-18 17:17:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:21,564 INFO L480 AbstractCegarLoop]: Abstraction has 108553 states and 121863 transitions. [2018-11-18 17:17:21,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 108553 states and 121863 transitions. [2018-11-18 17:17:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 17:17:21,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:17:21,617 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:17:21,617 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:17:21,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1412567213, now seen corresponding path program 1 times [2018-11-18 17:17:21,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:17:21,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:21,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:21,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:21,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:17:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:21,639 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-18 17:17:21,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:21,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:21,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:17:21,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:17:21,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:21,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:21,640 INFO L87 Difference]: Start difference. First operand 108553 states and 121863 transitions. Second operand 3 states. [2018-11-18 17:17:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:23,343 INFO L93 Difference]: Finished difference Result 243721 states and 269319 transitions. [2018-11-18 17:17:23,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:17:23,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 17:17:23,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:17:23,344 INFO L225 Difference]: With dead ends: 243721 [2018-11-18 17:17:23,344 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 17:17:23,477 INFO L604 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-18 17:17:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 17:17:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 17:17:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 17:17:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:17:23,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-11-18 17:17:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:17:23,477 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:17:23,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:17:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:17:23,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 17:17:23,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 17:17:23,528 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 17:17:23,528 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:17:23,528 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:17:23,528 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 17:17:23,528 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,529 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-11-18 17:17:23,530 INFO L425 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-18 17:17:23,530 INFO L425 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,530 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-11-18 17:17:23,530 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-18 17:17:23,530 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,530 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-11-18 17:17:23,530 INFO L428 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-11-18 17:17:23,530 INFO L425 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,530 INFO L425 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,530 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-11-18 17:17:23,530 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,530 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L428 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L421 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,531 INFO L425 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,532 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,532 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-18 17:17:23,532 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-11-18 17:17:23,532 INFO L425 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-11-18 17:17:23,532 INFO L425 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-11-18 17:17:23,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:17:23 BoogieIcfgContainer [2018-11-18 17:17:23,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:17:23,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:17:23,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:17:23,541 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:17:23,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:17:04" (3/4) ... [2018-11-18 17:17:23,545 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 17:17:23,555 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 17:17:23,555 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 17:17:23,560 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 17:17:23,561 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 17:17:23,561 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 17:17:23,615 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8deee167-232d-43e2-8787-b28d2c322d83/bin-2019/utaipan/witness.graphml [2018-11-18 17:17:23,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:17:23,616 INFO L168 Benchmark]: Toolchain (without parser) took 20085.39 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 959.8 MB in the beginning and 1.7 GB in the end (delta: -739.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 17:17:23,617 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:17:23,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 944.8 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:17:23,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.33 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-18 17:17:23,620 INFO L168 Benchmark]: Boogie Preprocessor took 20.66 ms. Allocated memory is still 1.0 GB. Free memory was 944.8 MB in the beginning and 942.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:17:23,620 INFO L168 Benchmark]: RCFGBuilder took 387.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 942.2 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:17:23,620 INFO L168 Benchmark]: TraceAbstraction took 19356.96 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -644.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 17:17:23,621 INFO L168 Benchmark]: Witness Printer took 74.91 ms. Allocated memory is still 2.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:17:23,622 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 944.8 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.33 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 20.66 ms. Allocated memory is still 1.0 GB. Free memory was 944.8 MB in the beginning and 942.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 387.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 942.2 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19356.96 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -644.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 74.91 ms. Allocated memory is still 2.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. 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, 51 locations, 1 error locations. SAFE Result, 19.3s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 9.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3487 SDtfs, 1713 SDslu, 2374 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108553occurred 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: 6.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 20515 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.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 941 ConstructedInterpolants, 0 QuantifiedInterpolants, 53057 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...