./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/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 5107685577f81a5867811396b2c0a05eb5630c95 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:34:17,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:34:17,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:34:17,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:34:17,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:34:17,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:34:17,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:34:17,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:34:17,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:34:17,810 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:34:17,811 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:34:17,811 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:34:17,812 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:34:17,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:34:17,814 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:34:17,815 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:34:17,816 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:34:17,817 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:34:17,819 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:34:17,820 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:34:17,821 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:34:17,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:34:17,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:34:17,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:34:17,825 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:34:17,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:34:17,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:34:17,827 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:34:17,828 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:34:17,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:34:17,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:34:17,830 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:34:17,830 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:34:17,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:34:17,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:34:17,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:34:17,832 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 23:34:17,841 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:34:17,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:34:17,842 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:34:17,842 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:34:17,842 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 23:34:17,842 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 23:34:17,842 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 23:34:17,843 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 23:34:17,843 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 23:34:17,843 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 23:34:17,843 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 23:34:17,843 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 23:34:17,843 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 23:34:17,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:34:17,844 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:34:17,844 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:34:17,844 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:34:17,844 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:34:17,844 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:34:17,844 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:34:17,845 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:34:17,845 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:34:17,845 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:34:17,845 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:34:17,845 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:34:17,845 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:34:17,846 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:34:17,846 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:34:17,846 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:34:17,846 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:34:17,846 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:34:17,846 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:34:17,846 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:34:17,847 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 23:34:17,847 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:34:17,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:34:17,847 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 23:34:17,847 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_b4226ef9-a936-4e10-871f-6422b426e23e/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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-11-22 23:34:17,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:34:17,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:34:17,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:34:17,885 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:34:17,886 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:34:17,887 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 23:34:17,941 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/bin-2019/utaipan/data/5c6955f74/3e80bef0fa844a95ad2b31595f0b8dbc/FLAG32d783101 [2018-11-22 23:34:18,304 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:34:18,304 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 23:34:18,312 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/bin-2019/utaipan/data/5c6955f74/3e80bef0fa844a95ad2b31595f0b8dbc/FLAG32d783101 [2018-11-22 23:34:18,324 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/bin-2019/utaipan/data/5c6955f74/3e80bef0fa844a95ad2b31595f0b8dbc [2018-11-22 23:34:18,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:34:18,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:34:18,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:34:18,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:34:18,331 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:34:18,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:34:18" (1/1) ... [2018-11-22 23:34:18,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18, skipping insertion in model container [2018-11-22 23:34:18,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:34:18" (1/1) ... [2018-11-22 23:34:18,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:34:18,363 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:34:18,509 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:34:18,512 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:34:18,533 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:34:18,547 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:34:18,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18 WrapperNode [2018-11-22 23:34:18,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:34:18,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:34:18,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:34:18,548 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:34:18,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18" (1/1) ... [2018-11-22 23:34:18,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18" (1/1) ... [2018-11-22 23:34:18,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:34:18,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:34:18,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:34:18,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:34:18,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18" (1/1) ... [2018-11-22 23:34:18,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18" (1/1) ... [2018-11-22 23:34:18,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18" (1/1) ... [2018-11-22 23:34:18,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18" (1/1) ... [2018-11-22 23:34:18,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18" (1/1) ... [2018-11-22 23:34:18,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18" (1/1) ... [2018-11-22 23:34:18,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18" (1/1) ... [2018-11-22 23:34:18,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:34:18,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:34:18,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:34:18,582 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:34:18,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/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-22 23:34:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:34:18,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:34:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:34:18,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:34:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:34:18,672 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:34:18,874 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:34:18,874 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 23:34:18,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:34:18 BoogieIcfgContainer [2018-11-22 23:34:18,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:34:18,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:34:18,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:34:18,877 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:34:18,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:34:18" (1/3) ... [2018-11-22 23:34:18,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fc895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:34:18, skipping insertion in model container [2018-11-22 23:34:18,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:18" (2/3) ... [2018-11-22 23:34:18,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fc895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:34:18, skipping insertion in model container [2018-11-22 23:34:18,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:34:18" (3/3) ... [2018-11-22 23:34:18,879 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 23:34:18,886 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:34:18,891 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:34:18,902 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:34:18,932 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:34:18,932 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:34:18,932 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:34:18,932 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:34:18,933 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:34:18,933 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:34:18,933 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:34:18,933 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:34:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-22 23:34:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 23:34:18,952 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:18,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:18,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:18,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2018-11-22 23:34:18,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:18,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:18,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:34:19,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,108 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-11-22 23:34:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:19,159 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2018-11-22 23:34:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:19,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-22 23:34:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:19,169 INFO L225 Difference]: With dead ends: 81 [2018-11-22 23:34:19,169 INFO L226 Difference]: Without dead ends: 66 [2018-11-22 23:34:19,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-22 23:34:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-11-22 23:34:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-22 23:34:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2018-11-22 23:34:19,207 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2018-11-22 23:34:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:19,207 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2018-11-22 23:34:19,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2018-11-22 23:34:19,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 23:34:19,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:19,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:19,209 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:19,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:19,209 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2018-11-22 23:34:19,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:19,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:19,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,249 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-22 23:34:19,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,252 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2018-11-22 23:34:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:19,284 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2018-11-22 23:34:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:19,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-22 23:34:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:19,286 INFO L225 Difference]: With dead ends: 107 [2018-11-22 23:34:19,286 INFO L226 Difference]: Without dead ends: 66 [2018-11-22 23:34:19,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-22 23:34:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-22 23:34:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-22 23:34:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2018-11-22 23:34:19,294 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2018-11-22 23:34:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:19,295 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2018-11-22 23:34:19,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2018-11-22 23:34:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 23:34:19,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:19,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:19,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:19,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2018-11-22 23:34:19,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:19,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:19,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,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-22 23:34:19,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,337 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2018-11-22 23:34:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:19,363 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2018-11-22 23:34:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:19,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-22 23:34:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:19,364 INFO L225 Difference]: With dead ends: 99 [2018-11-22 23:34:19,364 INFO L226 Difference]: Without dead ends: 69 [2018-11-22 23:34:19,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-22 23:34:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-22 23:34:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-22 23:34:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2018-11-22 23:34:19,369 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2018-11-22 23:34:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:19,370 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2018-11-22 23:34:19,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2018-11-22 23:34:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 23:34:19,370 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:19,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:19,371 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:19,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2018-11-22 23:34:19,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,400 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-22 23:34:19,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,401 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2018-11-22 23:34:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:19,421 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2018-11-22 23:34:19,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:19,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-22 23:34:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:19,422 INFO L225 Difference]: With dead ends: 124 [2018-11-22 23:34:19,422 INFO L226 Difference]: Without dead ends: 122 [2018-11-22 23:34:19,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-22 23:34:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2018-11-22 23:34:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-22 23:34:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2018-11-22 23:34:19,431 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2018-11-22 23:34:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:19,431 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2018-11-22 23:34:19,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2018-11-22 23:34:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 23:34:19,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:19,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:19,433 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:19,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2018-11-22 23:34:19,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:19,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:19,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,459 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-22 23:34:19,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,459 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,460 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2018-11-22 23:34:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:19,482 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2018-11-22 23:34:19,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:19,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-22 23:34:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:19,484 INFO L225 Difference]: With dead ends: 204 [2018-11-22 23:34:19,484 INFO L226 Difference]: Without dead ends: 124 [2018-11-22 23:34:19,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-22 23:34:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-22 23:34:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-22 23:34:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2018-11-22 23:34:19,497 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2018-11-22 23:34:19,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:19,497 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2018-11-22 23:34:19,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2018-11-22 23:34:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 23:34:19,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:19,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:19,498 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:19,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:19,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2018-11-22 23:34:19,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:19,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:19,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,531 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-22 23:34:19,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,532 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2018-11-22 23:34:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:19,551 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2018-11-22 23:34:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:19,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-22 23:34:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:19,552 INFO L225 Difference]: With dead ends: 183 [2018-11-22 23:34:19,552 INFO L226 Difference]: Without dead ends: 126 [2018-11-22 23:34:19,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-22 23:34:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-11-22 23:34:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-22 23:34:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2018-11-22 23:34:19,560 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2018-11-22 23:34:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:19,561 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2018-11-22 23:34:19,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2018-11-22 23:34:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 23:34:19,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:19,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:19,562 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:19,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:19,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2018-11-22 23:34:19,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:19,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:19,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,598 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-22 23:34:19,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,599 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2018-11-22 23:34:19,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:19,618 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2018-11-22 23:34:19,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:19,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-22 23:34:19,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:19,620 INFO L225 Difference]: With dead ends: 228 [2018-11-22 23:34:19,620 INFO L226 Difference]: Without dead ends: 226 [2018-11-22 23:34:19,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-22 23:34:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2018-11-22 23:34:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-22 23:34:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2018-11-22 23:34:19,630 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2018-11-22 23:34:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:19,630 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2018-11-22 23:34:19,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2018-11-22 23:34:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 23:34:19,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:19,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:19,632 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:19,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2018-11-22 23:34:19,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:19,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:19,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,663 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-22 23:34:19,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,664 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2018-11-22 23:34:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:19,703 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2018-11-22 23:34:19,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:19,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-22 23:34:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:19,706 INFO L225 Difference]: With dead ends: 392 [2018-11-22 23:34:19,706 INFO L226 Difference]: Without dead ends: 234 [2018-11-22 23:34:19,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-22 23:34:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-11-22 23:34:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-22 23:34:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2018-11-22 23:34:19,721 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2018-11-22 23:34:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:19,721 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2018-11-22 23:34:19,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2018-11-22 23:34:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 23:34:19,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:19,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:19,724 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:19,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:19,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2018-11-22 23:34:19,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:19,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:19,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,748 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-22 23:34:19,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,750 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2018-11-22 23:34:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:19,778 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2018-11-22 23:34:19,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:19,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-22 23:34:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:19,780 INFO L225 Difference]: With dead ends: 348 [2018-11-22 23:34:19,780 INFO L226 Difference]: Without dead ends: 238 [2018-11-22 23:34:19,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-22 23:34:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-11-22 23:34:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-22 23:34:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2018-11-22 23:34:19,790 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2018-11-22 23:34:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:19,791 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2018-11-22 23:34:19,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2018-11-22 23:34:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 23:34:19,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:19,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:19,792 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:19,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2018-11-22 23:34:19,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:19,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:19,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,809 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-22 23:34:19,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,811 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2018-11-22 23:34:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:19,847 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2018-11-22 23:34:19,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:19,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-22 23:34:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:19,849 INFO L225 Difference]: With dead ends: 428 [2018-11-22 23:34:19,849 INFO L226 Difference]: Without dead ends: 426 [2018-11-22 23:34:19,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-11-22 23:34:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2018-11-22 23:34:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-22 23:34:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2018-11-22 23:34:19,864 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2018-11-22 23:34:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:19,864 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2018-11-22 23:34:19,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2018-11-22 23:34:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 23:34:19,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:19,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:19,866 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:19,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:19,866 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2018-11-22 23:34:19,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:19,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:19,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,884 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-22 23:34:19,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,886 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2018-11-22 23:34:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:19,907 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2018-11-22 23:34:19,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:19,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-22 23:34:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:19,910 INFO L225 Difference]: With dead ends: 764 [2018-11-22 23:34:19,910 INFO L226 Difference]: Without dead ends: 450 [2018-11-22 23:34:19,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-22 23:34:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2018-11-22 23:34:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-11-22 23:34:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2018-11-22 23:34:19,929 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2018-11-22 23:34:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:19,929 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2018-11-22 23:34:19,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2018-11-22 23:34:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 23:34:19,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:19,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:19,931 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:19,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:19,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2018-11-22 23:34:19,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:19,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:19,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:19,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:19,963 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-22 23:34:19,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:19,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:19,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:19,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:19,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:19,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:19,964 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2018-11-22 23:34:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:20,003 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2018-11-22 23:34:20,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:20,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-22 23:34:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:20,005 INFO L225 Difference]: With dead ends: 672 [2018-11-22 23:34:20,005 INFO L226 Difference]: Without dead ends: 458 [2018-11-22 23:34:20,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-11-22 23:34:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2018-11-22 23:34:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-22 23:34:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2018-11-22 23:34:20,022 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2018-11-22 23:34:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:20,023 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2018-11-22 23:34:20,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2018-11-22 23:34:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 23:34:20,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:20,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:20,024 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:20,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:20,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2018-11-22 23:34:20,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:20,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:20,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:34:20,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:20,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:20,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:20,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:20,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:20,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,059 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2018-11-22 23:34:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:20,085 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2018-11-22 23:34:20,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:20,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-22 23:34:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:20,089 INFO L225 Difference]: With dead ends: 812 [2018-11-22 23:34:20,089 INFO L226 Difference]: Without dead ends: 810 [2018-11-22 23:34:20,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-22 23:34:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2018-11-22 23:34:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-22 23:34:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2018-11-22 23:34:20,117 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2018-11-22 23:34:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:20,117 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2018-11-22 23:34:20,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2018-11-22 23:34:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 23:34:20,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:20,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:20,121 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:20,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:20,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2018-11-22 23:34:20,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:20,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:20,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:20,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-22 23:34:20,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:20,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:20,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:20,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:20,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:20,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,145 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2018-11-22 23:34:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:20,178 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2018-11-22 23:34:20,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:20,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-22 23:34:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:20,182 INFO L225 Difference]: With dead ends: 1500 [2018-11-22 23:34:20,182 INFO L226 Difference]: Without dead ends: 874 [2018-11-22 23:34:20,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-22 23:34:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2018-11-22 23:34:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-22 23:34:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2018-11-22 23:34:20,217 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2018-11-22 23:34:20,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:20,218 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2018-11-22 23:34:20,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2018-11-22 23:34:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 23:34:20,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:20,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:20,220 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:20,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:20,220 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2018-11-22 23:34:20,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:20,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:20,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:20,251 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-22 23:34:20,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:20,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:20,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:20,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:20,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:20,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,253 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2018-11-22 23:34:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:20,303 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2018-11-22 23:34:20,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:20,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-22 23:34:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:20,306 INFO L225 Difference]: With dead ends: 1308 [2018-11-22 23:34:20,306 INFO L226 Difference]: Without dead ends: 890 [2018-11-22 23:34:20,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-11-22 23:34:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2018-11-22 23:34:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-11-22 23:34:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2018-11-22 23:34:20,340 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2018-11-22 23:34:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:20,341 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2018-11-22 23:34:20,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2018-11-22 23:34:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 23:34:20,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:20,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:20,343 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:20,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:20,343 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2018-11-22 23:34:20,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:20,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:20,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:20,359 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-22 23:34:20,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:20,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:20,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:20,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:20,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:20,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,364 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2018-11-22 23:34:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:20,416 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2018-11-22 23:34:20,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:20,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-22 23:34:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:20,421 INFO L225 Difference]: With dead ends: 1548 [2018-11-22 23:34:20,421 INFO L226 Difference]: Without dead ends: 1546 [2018-11-22 23:34:20,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-11-22 23:34:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2018-11-22 23:34:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-11-22 23:34:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2018-11-22 23:34:20,467 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2018-11-22 23:34:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:20,468 INFO L480 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2018-11-22 23:34:20,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2018-11-22 23:34:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 23:34:20,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:20,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:20,470 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:20,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:20,471 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2018-11-22 23:34:20,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:20,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:20,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:20,488 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-22 23:34:20,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:20,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:20,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:20,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:20,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:20,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,490 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2018-11-22 23:34:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:20,550 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2018-11-22 23:34:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:20,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-22 23:34:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:20,556 INFO L225 Difference]: With dead ends: 2956 [2018-11-22 23:34:20,557 INFO L226 Difference]: Without dead ends: 1706 [2018-11-22 23:34:20,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-11-22 23:34:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2018-11-22 23:34:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2018-11-22 23:34:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2018-11-22 23:34:20,647 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2018-11-22 23:34:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:20,647 INFO L480 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2018-11-22 23:34:20,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2018-11-22 23:34:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 23:34:20,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:20,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:20,650 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:20,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:20,651 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2018-11-22 23:34:20,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:20,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:20,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:20,671 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-22 23:34:20,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:20,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:20,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:20,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:20,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:20,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,672 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2018-11-22 23:34:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:20,723 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2018-11-22 23:34:20,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:20,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-22 23:34:20,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:20,729 INFO L225 Difference]: With dead ends: 2556 [2018-11-22 23:34:20,729 INFO L226 Difference]: Without dead ends: 1738 [2018-11-22 23:34:20,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-22 23:34:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2018-11-22 23:34:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2018-11-22 23:34:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2018-11-22 23:34:20,790 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2018-11-22 23:34:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:20,790 INFO L480 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2018-11-22 23:34:20,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2018-11-22 23:34:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 23:34:20,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:20,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:20,793 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:20,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:20,793 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2018-11-22 23:34:20,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:20,819 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-22 23:34:20,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:20,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:20,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:20,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:20,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:20,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,820 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2018-11-22 23:34:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:20,896 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2018-11-22 23:34:20,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:20,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-22 23:34:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:20,905 INFO L225 Difference]: With dead ends: 2956 [2018-11-22 23:34:20,905 INFO L226 Difference]: Without dead ends: 2954 [2018-11-22 23:34:20,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-11-22 23:34:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2018-11-22 23:34:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2018-11-22 23:34:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2018-11-22 23:34:20,984 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2018-11-22 23:34:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:20,984 INFO L480 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2018-11-22 23:34:20,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2018-11-22 23:34:20,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 23:34:20,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:20,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:20,988 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:20,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:20,988 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2018-11-22 23:34:20,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:20,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:20,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:20,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:21,012 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-22 23:34:21,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:21,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:21,013 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:21,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:21,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:21,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:21,014 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2018-11-22 23:34:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:21,100 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2018-11-22 23:34:21,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:21,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-22 23:34:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:21,110 INFO L225 Difference]: With dead ends: 5836 [2018-11-22 23:34:21,111 INFO L226 Difference]: Without dead ends: 3338 [2018-11-22 23:34:21,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-22 23:34:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2018-11-22 23:34:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-22 23:34:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2018-11-22 23:34:21,230 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2018-11-22 23:34:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:21,230 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2018-11-22 23:34:21,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2018-11-22 23:34:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 23:34:21,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:21,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:21,234 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:21,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:21,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2018-11-22 23:34:21,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:21,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:21,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:21,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:21,251 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-22 23:34:21,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:21,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:21,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:21,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:21,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:21,252 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2018-11-22 23:34:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:21,344 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2018-11-22 23:34:21,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:21,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-22 23:34:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:21,354 INFO L225 Difference]: With dead ends: 5004 [2018-11-22 23:34:21,354 INFO L226 Difference]: Without dead ends: 3402 [2018-11-22 23:34:21,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2018-11-22 23:34:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2018-11-22 23:34:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2018-11-22 23:34:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2018-11-22 23:34:21,470 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2018-11-22 23:34:21,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:21,470 INFO L480 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2018-11-22 23:34:21,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:21,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2018-11-22 23:34:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 23:34:21,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:21,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:21,474 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:21,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:21,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2018-11-22 23:34:21,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:21,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:21,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:21,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:21,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:21,495 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-22 23:34:21,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:21,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:21,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:21,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:21,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:21,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:21,496 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2018-11-22 23:34:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:21,653 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2018-11-22 23:34:21,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:21,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-22 23:34:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:21,671 INFO L225 Difference]: With dead ends: 9804 [2018-11-22 23:34:21,671 INFO L226 Difference]: Without dead ends: 6538 [2018-11-22 23:34:21,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2018-11-22 23:34:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2018-11-22 23:34:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-11-22 23:34:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2018-11-22 23:34:21,881 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2018-11-22 23:34:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:21,881 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2018-11-22 23:34:21,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2018-11-22 23:34:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 23:34:21,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:21,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:21,888 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:21,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2018-11-22 23:34:21,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:21,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:21,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:21,910 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-22 23:34:21,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:21,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:21,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:21,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:21,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:21,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:21,912 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2018-11-22 23:34:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:22,073 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2018-11-22 23:34:22,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:22,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-22 23:34:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:22,085 INFO L225 Difference]: With dead ends: 7052 [2018-11-22 23:34:22,086 INFO L226 Difference]: Without dead ends: 7050 [2018-11-22 23:34:22,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:22,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2018-11-22 23:34:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2018-11-22 23:34:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-11-22 23:34:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2018-11-22 23:34:22,278 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2018-11-22 23:34:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:22,278 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2018-11-22 23:34:22,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2018-11-22 23:34:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 23:34:22,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:22,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:22,286 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:22,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:22,286 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2018-11-22 23:34:22,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:22,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:22,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:22,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:22,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:22,303 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-22 23:34:22,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:22,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:22,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:22,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:22,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:22,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:22,304 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2018-11-22 23:34:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:22,514 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2018-11-22 23:34:22,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:22,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-22 23:34:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:22,533 INFO L225 Difference]: With dead ends: 10634 [2018-11-22 23:34:22,533 INFO L226 Difference]: Without dead ends: 10632 [2018-11-22 23:34:22,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2018-11-22 23:34:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2018-11-22 23:34:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2018-11-22 23:34:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2018-11-22 23:34:22,695 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2018-11-22 23:34:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:22,695 INFO L480 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2018-11-22 23:34:22,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2018-11-22 23:34:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 23:34:22,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:22,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:22,704 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:22,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:22,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2018-11-22 23:34:22,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:22,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:22,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:22,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:22,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:22,722 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-22 23:34:22,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:22,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:34:22,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:22,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:34:22,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:34:22,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:22,724 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2018-11-22 23:34:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:22,871 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2018-11-22 23:34:22,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:34:22,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-22 23:34:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:22,872 INFO L225 Difference]: With dead ends: 22664 [2018-11-22 23:34:22,872 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 23:34:22,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:34:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 23:34:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 23:34:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 23:34:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 23:34:22,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-22 23:34:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:22,889 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:34:22,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:34:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 23:34:22,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 23:34:22,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 23:34:22,911 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-22 23:34:22,911 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 23:34:22,911 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 23:34:22,911 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 23:34:22,911 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,912 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-22 23:34:22,913 INFO L451 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-11-22 23:34:22,913 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-11-22 23:34:22,913 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,913 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-22 23:34:22,913 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,913 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-11-22 23:34:22,913 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-22 23:34:22,913 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-22 23:34:22,913 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,913 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,913 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,913 INFO L451 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-11-22 23:34:22,914 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,914 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,914 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-11-22 23:34:22,915 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-22 23:34:22,915 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-22 23:34:22,915 INFO L444 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-11-22 23:34:22,915 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,915 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,915 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-22 23:34:22,915 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-11-22 23:34:22,915 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,915 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-11-22 23:34:22,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:34:22 BoogieIcfgContainer [2018-11-22 23:34:22,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:34:22,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:34:22,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:34:22,925 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:34:22,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:34:18" (3/4) ... [2018-11-22 23:34:22,929 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 23:34:22,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 23:34:22,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 23:34:22,939 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-22 23:34:22,940 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-22 23:34:22,940 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 23:34:22,989 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b4226ef9-a936-4e10-871f-6422b426e23e/bin-2019/utaipan/witness.graphml [2018-11-22 23:34:22,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:34:22,991 INFO L168 Benchmark]: Toolchain (without parser) took 4662.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 959.2 MB in the beginning and 967.9 MB in the end (delta: -8.7 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. [2018-11-22 23:34:22,992 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:34:22,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:34:22,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.58 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:34:22,993 INFO L168 Benchmark]: Boogie Preprocessor took 17.77 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:34:22,993 INFO L168 Benchmark]: RCFGBuilder took 292.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:34:22,993 INFO L168 Benchmark]: TraceAbstraction took 4050.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 973.5 MB in the end (delta: 142.1 MB). Peak memory consumption was 205.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:34:22,993 INFO L168 Benchmark]: Witness Printer took 64.24 ms. Allocated memory is still 1.2 GB. Free memory was 973.5 MB in the beginning and 967.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:34:22,995 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 219.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.58 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.77 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 292.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4050.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 973.5 MB in the end (delta: 142.1 MB). Peak memory consumption was 205.0 MB. Max. memory is 11.5 GB. * Witness Printer took 64.24 ms. Allocated memory is still 1.2 GB. Free memory was 973.5 MB in the beginning and 967.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, 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: 1.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...