./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/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 f2cbbf56a13532141372a32a461d64a9d1351c0e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:33:01,701 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:33:01,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:33:01,710 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:33:01,711 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:33:01,711 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:33:01,712 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:33:01,714 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:33:01,715 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:33:01,716 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:33:01,717 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:33:01,717 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:33:01,718 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:33:01,719 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:33:01,720 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:33:01,720 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:33:01,721 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:33:01,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:33:01,724 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:33:01,725 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:33:01,726 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:33:01,727 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:33:01,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:33:01,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:33:01,729 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:33:01,730 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:33:01,731 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:33:01,732 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:33:01,732 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:33:01,733 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:33:01,733 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:33:01,734 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:33:01,734 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:33:01,734 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:33:01,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:33:01,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:33:01,736 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 11:33:01,747 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:33:01,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:33:01,748 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:33:01,748 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:33:01,748 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:33:01,748 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:33:01,748 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:33:01,749 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 11:33:01,749 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:33:01,749 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:33:01,749 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 11:33:01,749 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 11:33:01,749 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:33:01,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:33:01,751 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:33:01,751 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:33:01,751 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:33:01,751 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:33:01,752 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:33:01,752 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:33:01,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:33:01,752 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:33:01,752 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:33:01,752 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:33:01,752 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:33:01,753 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:33:01,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:33:01,753 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:33:01,753 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:33:01,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:33:01,753 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:33:01,753 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:33:01,754 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:33:01,754 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 11:33:01,754 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:33:01,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:33:01,754 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 11:33:01,754 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_33e314b7-561e-4b3b-ba4a-ec71689c1512/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-11-18 11:33:01,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:33:01,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:33:01,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:33:01,791 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:33:01,792 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:33:01,792 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:33:01,834 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/data/d7161280e/b24de806b919406bbb041256d2639944/FLAG93e36f1b5 [2018-11-18 11:33:02,170 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:33:02,171 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:33:02,177 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/data/d7161280e/b24de806b919406bbb041256d2639944/FLAG93e36f1b5 [2018-11-18 11:33:02,593 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/data/d7161280e/b24de806b919406bbb041256d2639944 [2018-11-18 11:33:02,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:33:02,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:33:02,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:33:02,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:33:02,598 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:33:02,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:33:02" (1/1) ... [2018-11-18 11:33:02,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac16c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02, skipping insertion in model container [2018-11-18 11:33:02,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:33:02" (1/1) ... [2018-11-18 11:33:02,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:33:02,617 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:33:02,715 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:33:02,717 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:33:02,731 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:33:02,739 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:33:02,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02 WrapperNode [2018-11-18 11:33:02,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:33:02,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:33:02,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:33:02,740 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:33:02,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02" (1/1) ... [2018-11-18 11:33:02,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02" (1/1) ... [2018-11-18 11:33:02,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:33:02,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:33:02,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:33:02,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:33:02,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02" (1/1) ... [2018-11-18 11:33:02,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02" (1/1) ... [2018-11-18 11:33:02,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02" (1/1) ... [2018-11-18 11:33:02,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02" (1/1) ... [2018-11-18 11:33:02,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02" (1/1) ... [2018-11-18 11:33:02,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02" (1/1) ... [2018-11-18 11:33:02,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02" (1/1) ... [2018-11-18 11:33:02,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:33:02,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:33:02,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:33:02,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:33:02,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:33:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:33:02,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:33:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:33:02,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:33:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:33:02,853 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:33:03,029 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:33:03,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:33:03 BoogieIcfgContainer [2018-11-18 11:33:03,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:33:03,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:33:03,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:33:03,033 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:33:03,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:33:02" (1/3) ... [2018-11-18 11:33:03,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e99c268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:33:03, skipping insertion in model container [2018-11-18 11:33:03,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:33:02" (2/3) ... [2018-11-18 11:33:03,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e99c268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:33:03, skipping insertion in model container [2018-11-18 11:33:03,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:33:03" (3/3) ... [2018-11-18 11:33:03,036 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:33:03,043 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:33:03,050 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:33:03,059 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:33:03,084 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:33:03,084 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:33:03,084 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:33:03,084 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:33:03,084 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:33:03,084 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:33:03,085 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:33:03,085 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:33:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-18 11:33:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 11:33:03,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,107 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,108 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1244268193, now seen corresponding path program 1 times [2018-11-18 11:33:03,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,247 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-11-18 11:33:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,294 INFO L93 Difference]: Finished difference Result 77 states and 128 transitions. [2018-11-18 11:33:03,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 11:33:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,304 INFO L225 Difference]: With dead ends: 77 [2018-11-18 11:33:03,304 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 11:33:03,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 11:33:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-18 11:33:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 11:33:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2018-11-18 11:33:03,333 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2018-11-18 11:33:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,333 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2018-11-18 11:33:03,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2018-11-18 11:33:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 11:33:03,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,335 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash -543203615, now seen corresponding path program 1 times [2018-11-18 11:33:03,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,378 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand 3 states. [2018-11-18 11:33:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,393 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2018-11-18 11:33:03,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 11:33:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,395 INFO L225 Difference]: With dead ends: 100 [2018-11-18 11:33:03,395 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 11:33:03,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 11:33:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-18 11:33:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 11:33:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 103 transitions. [2018-11-18 11:33:03,400 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 103 transitions. Word has length 19 [2018-11-18 11:33:03,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,400 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 103 transitions. [2018-11-18 11:33:03,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2018-11-18 11:33:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 11:33:03,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,401 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,401 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash 82605710, now seen corresponding path program 1 times [2018-11-18 11:33:03,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,448 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,449 INFO L87 Difference]: Start difference. First operand 60 states and 103 transitions. Second operand 3 states. [2018-11-18 11:33:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,470 INFO L93 Difference]: Finished difference Result 94 states and 157 transitions. [2018-11-18 11:33:03,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 11:33:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,471 INFO L225 Difference]: With dead ends: 94 [2018-11-18 11:33:03,471 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 11:33:03,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 11:33:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-18 11:33:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 11:33:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2018-11-18 11:33:03,475 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 20 [2018-11-18 11:33:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,475 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2018-11-18 11:33:03,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2018-11-18 11:33:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 11:33:03,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,476 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash 340771148, now seen corresponding path program 1 times [2018-11-18 11:33:03,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,515 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 3 states. [2018-11-18 11:33:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,527 INFO L93 Difference]: Finished difference Result 117 states and 197 transitions. [2018-11-18 11:33:03,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 11:33:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,531 INFO L225 Difference]: With dead ends: 117 [2018-11-18 11:33:03,531 INFO L226 Difference]: Without dead ends: 115 [2018-11-18 11:33:03,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-18 11:33:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2018-11-18 11:33:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 11:33:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 139 transitions. [2018-11-18 11:33:03,539 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 139 transitions. Word has length 20 [2018-11-18 11:33:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,540 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 139 transitions. [2018-11-18 11:33:03,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 139 transitions. [2018-11-18 11:33:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 11:33:03,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,541 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1041835726, now seen corresponding path program 1 times [2018-11-18 11:33:03,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,563 INFO L87 Difference]: Start difference. First operand 83 states and 139 transitions. Second operand 3 states. [2018-11-18 11:33:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,578 INFO L93 Difference]: Finished difference Result 191 states and 325 transitions. [2018-11-18 11:33:03,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 11:33:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,579 INFO L225 Difference]: With dead ends: 191 [2018-11-18 11:33:03,579 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 11:33:03,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 11:33:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-18 11:33:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 11:33:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 191 transitions. [2018-11-18 11:33:03,586 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 191 transitions. Word has length 20 [2018-11-18 11:33:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,586 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 191 transitions. [2018-11-18 11:33:03,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 191 transitions. [2018-11-18 11:33:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 11:33:03,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,587 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,587 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1974185366, now seen corresponding path program 1 times [2018-11-18 11:33:03,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,605 INFO L87 Difference]: Start difference. First operand 115 states and 191 transitions. Second operand 3 states. [2018-11-18 11:33:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,615 INFO L93 Difference]: Finished difference Result 172 states and 284 transitions. [2018-11-18 11:33:03,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 11:33:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,616 INFO L225 Difference]: With dead ends: 172 [2018-11-18 11:33:03,616 INFO L226 Difference]: Without dead ends: 119 [2018-11-18 11:33:03,616 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-18 11:33:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-18 11:33:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 11:33:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 191 transitions. [2018-11-18 11:33:03,623 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 191 transitions. Word has length 21 [2018-11-18 11:33:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,623 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 191 transitions. [2018-11-18 11:33:03,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 191 transitions. [2018-11-18 11:33:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 11:33:03,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,624 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,624 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2062616492, now seen corresponding path program 1 times [2018-11-18 11:33:03,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,649 INFO L87 Difference]: Start difference. First operand 117 states and 191 transitions. Second operand 3 states. [2018-11-18 11:33:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,667 INFO L93 Difference]: Finished difference Result 213 states and 353 transitions. [2018-11-18 11:33:03,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 11:33:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,669 INFO L225 Difference]: With dead ends: 213 [2018-11-18 11:33:03,669 INFO L226 Difference]: Without dead ends: 211 [2018-11-18 11:33:03,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-18 11:33:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 157. [2018-11-18 11:33:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 11:33:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 255 transitions. [2018-11-18 11:33:03,677 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 255 transitions. Word has length 21 [2018-11-18 11:33:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,677 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 255 transitions. [2018-11-18 11:33:03,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 255 transitions. [2018-11-18 11:33:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 11:33:03,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,679 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,680 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1361551914, now seen corresponding path program 1 times [2018-11-18 11:33:03,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,704 INFO L87 Difference]: Start difference. First operand 157 states and 255 transitions. Second operand 3 states. [2018-11-18 11:33:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,743 INFO L93 Difference]: Finished difference Result 365 states and 597 transitions. [2018-11-18 11:33:03,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 11:33:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,745 INFO L225 Difference]: With dead ends: 365 [2018-11-18 11:33:03,745 INFO L226 Difference]: Without dead ends: 219 [2018-11-18 11:33:03,746 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-18 11:33:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-11-18 11:33:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-18 11:33:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 347 transitions. [2018-11-18 11:33:03,755 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 347 transitions. Word has length 21 [2018-11-18 11:33:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,755 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 347 transitions. [2018-11-18 11:33:03,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 347 transitions. [2018-11-18 11:33:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:33:03,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,757 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash 483612899, now seen corresponding path program 1 times [2018-11-18 11:33:03,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,789 INFO L87 Difference]: Start difference. First operand 217 states and 347 transitions. Second operand 3 states. [2018-11-18 11:33:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,810 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-11-18 11:33:03,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 11:33:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,812 INFO L225 Difference]: With dead ends: 325 [2018-11-18 11:33:03,812 INFO L226 Difference]: Without dead ends: 223 [2018-11-18 11:33:03,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-18 11:33:03,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-11-18 11:33:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-18 11:33:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2018-11-18 11:33:03,819 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 22 [2018-11-18 11:33:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,819 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2018-11-18 11:33:03,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2018-11-18 11:33:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:33:03,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,820 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,820 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash 741778337, now seen corresponding path program 1 times [2018-11-18 11:33:03,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,843 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand 3 states. [2018-11-18 11:33:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,864 INFO L93 Difference]: Finished difference Result 397 states and 633 transitions. [2018-11-18 11:33:03,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 11:33:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,866 INFO L225 Difference]: With dead ends: 397 [2018-11-18 11:33:03,866 INFO L226 Difference]: Without dead ends: 395 [2018-11-18 11:33:03,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-11-18 11:33:03,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 305. [2018-11-18 11:33:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-18 11:33:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 471 transitions. [2018-11-18 11:33:03,873 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 471 transitions. Word has length 22 [2018-11-18 11:33:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,873 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 471 transitions. [2018-11-18 11:33:03,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 471 transitions. [2018-11-18 11:33:03,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:33:03,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,874 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,875 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842915, now seen corresponding path program 1 times [2018-11-18 11:33:03,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,899 INFO L87 Difference]: Start difference. First operand 305 states and 471 transitions. Second operand 3 states. [2018-11-18 11:33:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,918 INFO L93 Difference]: Finished difference Result 709 states and 1097 transitions. [2018-11-18 11:33:03,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 11:33:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,919 INFO L225 Difference]: With dead ends: 709 [2018-11-18 11:33:03,919 INFO L226 Difference]: Without dead ends: 419 [2018-11-18 11:33:03,920 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-18 11:33:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-11-18 11:33:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-18 11:33:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 631 transitions. [2018-11-18 11:33:03,929 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 631 transitions. Word has length 22 [2018-11-18 11:33:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,929 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 631 transitions. [2018-11-18 11:33:03,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2018-11-18 11:33:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 11:33:03,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,930 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,930 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1520507019, now seen corresponding path program 1 times [2018-11-18 11:33:03,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:03,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:03,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:03,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:03,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:03,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:03,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,951 INFO L87 Difference]: Start difference. First operand 417 states and 631 transitions. Second operand 3 states. [2018-11-18 11:33:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:03,975 INFO L93 Difference]: Finished difference Result 625 states and 941 transitions. [2018-11-18 11:33:03,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:03,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 11:33:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:03,977 INFO L225 Difference]: With dead ends: 625 [2018-11-18 11:33:03,977 INFO L226 Difference]: Without dead ends: 427 [2018-11-18 11:33:03,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-11-18 11:33:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2018-11-18 11:33:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-18 11:33:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 631 transitions. [2018-11-18 11:33:03,986 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 631 transitions. Word has length 23 [2018-11-18 11:33:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:03,986 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 631 transitions. [2018-11-18 11:33:03,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 631 transitions. [2018-11-18 11:33:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 11:33:03,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:03,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:03,987 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:03,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:03,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1778672457, now seen corresponding path program 1 times [2018-11-18 11:33:03,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:03,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:03,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:04,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:04,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:04,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:04,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:04,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:04,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,008 INFO L87 Difference]: Start difference. First operand 425 states and 631 transitions. Second operand 3 states. [2018-11-18 11:33:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:04,029 INFO L93 Difference]: Finished difference Result 1213 states and 1785 transitions. [2018-11-18 11:33:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:04,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 11:33:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:04,031 INFO L225 Difference]: With dead ends: 1213 [2018-11-18 11:33:04,031 INFO L226 Difference]: Without dead ends: 811 [2018-11-18 11:33:04,032 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2018-11-18 11:33:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 809. [2018-11-18 11:33:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-18 11:33:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1159 transitions. [2018-11-18 11:33:04,048 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1159 transitions. Word has length 23 [2018-11-18 11:33:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:04,048 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1159 transitions. [2018-11-18 11:33:04,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1159 transitions. [2018-11-18 11:33:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 11:33:04,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:04,049 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:04,050 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:04,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1077607879, now seen corresponding path program 1 times [2018-11-18 11:33:04,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:04,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:04,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:04,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:04,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:04,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:04,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:04,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,072 INFO L87 Difference]: Start difference. First operand 809 states and 1159 transitions. Second operand 3 states. [2018-11-18 11:33:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:04,092 INFO L93 Difference]: Finished difference Result 957 states and 1401 transitions. [2018-11-18 11:33:04,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:04,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 11:33:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:04,094 INFO L225 Difference]: With dead ends: 957 [2018-11-18 11:33:04,094 INFO L226 Difference]: Without dead ends: 955 [2018-11-18 11:33:04,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-11-18 11:33:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 809. [2018-11-18 11:33:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-18 11:33:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1143 transitions. [2018-11-18 11:33:04,112 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1143 transitions. Word has length 23 [2018-11-18 11:33:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:04,113 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1143 transitions. [2018-11-18 11:33:04,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1143 transitions. [2018-11-18 11:33:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:33:04,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:04,114 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:04,114 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:04,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:04,114 INFO L82 PathProgramCache]: Analyzing trace with hash -695513288, now seen corresponding path program 1 times [2018-11-18 11:33:04,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:04,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:04,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:04,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:04,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:04,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:04,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:04,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:04,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,135 INFO L87 Difference]: Start difference. First operand 809 states and 1143 transitions. Second operand 3 states. [2018-11-18 11:33:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:04,157 INFO L93 Difference]: Finished difference Result 1405 states and 2009 transitions. [2018-11-18 11:33:04,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:04,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 11:33:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:04,160 INFO L225 Difference]: With dead ends: 1405 [2018-11-18 11:33:04,160 INFO L226 Difference]: Without dead ends: 1403 [2018-11-18 11:33:04,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-11-18 11:33:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1177. [2018-11-18 11:33:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-18 11:33:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1623 transitions. [2018-11-18 11:33:04,185 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1623 transitions. Word has length 24 [2018-11-18 11:33:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:04,185 INFO L480 AbstractCegarLoop]: Abstraction has 1177 states and 1623 transitions. [2018-11-18 11:33:04,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1623 transitions. [2018-11-18 11:33:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:33:04,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:04,187 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:04,187 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:04,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:04,187 INFO L82 PathProgramCache]: Analyzing trace with hash 5551290, now seen corresponding path program 1 times [2018-11-18 11:33:04,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:04,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:04,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:04,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:04,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:04,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:04,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:04,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:04,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,210 INFO L87 Difference]: Start difference. First operand 1177 states and 1623 transitions. Second operand 3 states. [2018-11-18 11:33:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:04,242 INFO L93 Difference]: Finished difference Result 2717 states and 3737 transitions. [2018-11-18 11:33:04,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:04,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 11:33:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:04,245 INFO L225 Difference]: With dead ends: 2717 [2018-11-18 11:33:04,245 INFO L226 Difference]: Without dead ends: 1563 [2018-11-18 11:33:04,247 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-11-18 11:33:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1561. [2018-11-18 11:33:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-11-18 11:33:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2087 transitions. [2018-11-18 11:33:04,279 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2087 transitions. Word has length 24 [2018-11-18 11:33:04,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:04,279 INFO L480 AbstractCegarLoop]: Abstraction has 1561 states and 2087 transitions. [2018-11-18 11:33:04,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2087 transitions. [2018-11-18 11:33:04,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:33:04,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:04,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:04,281 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:04,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:04,281 INFO L82 PathProgramCache]: Analyzing trace with hash -85859714, now seen corresponding path program 1 times [2018-11-18 11:33:04,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:04,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:04,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:04,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:04,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:04,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:04,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,304 INFO L87 Difference]: Start difference. First operand 1561 states and 2087 transitions. Second operand 3 states. [2018-11-18 11:33:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:04,335 INFO L93 Difference]: Finished difference Result 2365 states and 3161 transitions. [2018-11-18 11:33:04,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:04,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:33:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:04,338 INFO L225 Difference]: With dead ends: 2365 [2018-11-18 11:33:04,338 INFO L226 Difference]: Without dead ends: 1611 [2018-11-18 11:33:04,340 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-11-18 11:33:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1609. [2018-11-18 11:33:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2018-11-18 11:33:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2119 transitions. [2018-11-18 11:33:04,369 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2119 transitions. Word has length 25 [2018-11-18 11:33:04,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:04,369 INFO L480 AbstractCegarLoop]: Abstraction has 1609 states and 2119 transitions. [2018-11-18 11:33:04,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2119 transitions. [2018-11-18 11:33:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:33:04,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:04,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:04,372 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:04,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash 172305724, now seen corresponding path program 1 times [2018-11-18 11:33:04,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:04,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:04,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:04,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:04,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:04,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:04,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:04,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:04,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,395 INFO L87 Difference]: Start difference. First operand 1609 states and 2119 transitions. Second operand 3 states. [2018-11-18 11:33:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:04,436 INFO L93 Difference]: Finished difference Result 2701 states and 3561 transitions. [2018-11-18 11:33:04,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:04,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:33:04,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:04,441 INFO L225 Difference]: With dead ends: 2701 [2018-11-18 11:33:04,441 INFO L226 Difference]: Without dead ends: 2699 [2018-11-18 11:33:04,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2018-11-18 11:33:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2377. [2018-11-18 11:33:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-18 11:33:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3047 transitions. [2018-11-18 11:33:04,490 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3047 transitions. Word has length 25 [2018-11-18 11:33:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:04,490 INFO L480 AbstractCegarLoop]: Abstraction has 2377 states and 3047 transitions. [2018-11-18 11:33:04,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3047 transitions. [2018-11-18 11:33:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:33:04,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:04,514 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:04,514 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:04,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:04,515 INFO L82 PathProgramCache]: Analyzing trace with hash 873370302, now seen corresponding path program 1 times [2018-11-18 11:33:04,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:04,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:04,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:04,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:04,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:04,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:04,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,527 INFO L87 Difference]: Start difference. First operand 2377 states and 3047 transitions. Second operand 3 states. [2018-11-18 11:33:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:04,591 INFO L93 Difference]: Finished difference Result 5389 states and 6825 transitions. [2018-11-18 11:33:04,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:04,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:33:04,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:04,599 INFO L225 Difference]: With dead ends: 5389 [2018-11-18 11:33:04,599 INFO L226 Difference]: Without dead ends: 3083 [2018-11-18 11:33:04,601 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-11-18 11:33:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3081. [2018-11-18 11:33:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2018-11-18 11:33:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 3783 transitions. [2018-11-18 11:33:04,659 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 3783 transitions. Word has length 25 [2018-11-18 11:33:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:04,659 INFO L480 AbstractCegarLoop]: Abstraction has 3081 states and 3783 transitions. [2018-11-18 11:33:04,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 3783 transitions. [2018-11-18 11:33:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:33:04,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:04,662 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:04,662 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:04,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:04,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1046726223, now seen corresponding path program 1 times [2018-11-18 11:33:04,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:04,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:04,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:04,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:04,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:04,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:04,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,683 INFO L87 Difference]: Start difference. First operand 3081 states and 3783 transitions. Second operand 3 states. [2018-11-18 11:33:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:04,722 INFO L93 Difference]: Finished difference Result 4621 states and 5641 transitions. [2018-11-18 11:33:04,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:04,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:33:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:04,727 INFO L225 Difference]: With dead ends: 4621 [2018-11-18 11:33:04,727 INFO L226 Difference]: Without dead ends: 3147 [2018-11-18 11:33:04,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-11-18 11:33:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 3145. [2018-11-18 11:33:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-11-18 11:33:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 3783 transitions. [2018-11-18 11:33:04,786 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 3783 transitions. Word has length 26 [2018-11-18 11:33:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:04,786 INFO L480 AbstractCegarLoop]: Abstraction has 3145 states and 3783 transitions. [2018-11-18 11:33:04,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 3783 transitions. [2018-11-18 11:33:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:33:04,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:04,788 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:04,789 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:04,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1304891661, now seen corresponding path program 1 times [2018-11-18 11:33:04,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:04,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:04,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:04,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:04,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:04,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:04,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,807 INFO L87 Difference]: Start difference. First operand 3145 states and 3783 transitions. Second operand 3 states. [2018-11-18 11:33:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:04,875 INFO L93 Difference]: Finished difference Result 5131 states and 6088 transitions. [2018-11-18 11:33:04,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:04,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:33:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:04,884 INFO L225 Difference]: With dead ends: 5131 [2018-11-18 11:33:04,884 INFO L226 Difference]: Without dead ends: 5129 [2018-11-18 11:33:04,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2018-11-18 11:33:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 4745. [2018-11-18 11:33:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2018-11-18 11:33:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 5575 transitions. [2018-11-18 11:33:04,960 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 5575 transitions. Word has length 26 [2018-11-18 11:33:04,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:04,960 INFO L480 AbstractCegarLoop]: Abstraction has 4745 states and 5575 transitions. [2018-11-18 11:33:04,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 5575 transitions. [2018-11-18 11:33:04,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:33:04,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:33:04,964 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:33:04,964 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:33:04,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:33:04,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2005956239, now seen corresponding path program 1 times [2018-11-18 11:33:04,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:33:04,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:33:04,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:33:04,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:33:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:33:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:33:04,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:33:04,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:33:04,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:33:04,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:33:04,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:33:04,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:04,980 INFO L87 Difference]: Start difference. First operand 4745 states and 5575 transitions. Second operand 3 states. [2018-11-18 11:33:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:33:05,067 INFO L93 Difference]: Finished difference Result 10633 states and 12231 transitions. [2018-11-18 11:33:05,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:33:05,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:33:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:33:05,068 INFO L225 Difference]: With dead ends: 10633 [2018-11-18 11:33:05,068 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 11:33:05,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:33:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 11:33:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 11:33:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 11:33:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 11:33:05,076 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-18 11:33:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:33:05,076 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:33:05,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:33:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:33:05,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 11:33:05,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 11:33:05,093 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 11:33:05,093 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:33:05,093 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:33:05,093 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 11:33:05,093 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 11:33:05,093 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:33:05,093 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L421 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,094 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L428 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L428 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,095 INFO L425 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-11-18 11:33:05,096 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-18 11:33:05,096 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 11:33:05,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:33:05 BoogieIcfgContainer [2018-11-18 11:33:05,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:33:05,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:33:05,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:33:05,101 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:33:05,105 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:33:03" (3/4) ... [2018-11-18 11:33:05,107 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 11:33:05,111 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 11:33:05,111 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 11:33:05,115 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 11:33:05,115 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 11:33:05,115 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 11:33:05,152 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_33e314b7-561e-4b3b-ba4a-ec71689c1512/bin-2019/utaipan/witness.graphml [2018-11-18 11:33:05,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:33:05,153 INFO L168 Benchmark]: Toolchain (without parser) took 2557.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 959.1 MB in the beginning and 938.6 MB in the end (delta: 20.6 MB). Peak memory consumption was 251.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:33:05,154 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:33:05,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.84 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:33:05,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.29 ms. Allocated memory is still 1.0 GB. Free memory was 948.2 MB in the beginning and 945.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:33:05,154 INFO L168 Benchmark]: Boogie Preprocessor took 16.99 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:33:05,155 INFO L168 Benchmark]: RCFGBuilder took 259.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:33:05,155 INFO L168 Benchmark]: TraceAbstraction took 2070.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 944.0 MB in the end (delta: 175.7 MB). Peak memory consumption was 263.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:33:05,155 INFO L168 Benchmark]: Witness Printer took 51.12 ms. Allocated memory is still 1.3 GB. Free memory was 944.0 MB in the beginning and 938.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:33:05,156 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.84 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.29 ms. Allocated memory is still 1.0 GB. Free memory was 948.2 MB in the beginning and 945.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.99 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 259.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2070.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 944.0 MB in the end (delta: 175.7 MB). Peak memory consumption was 263.2 MB. Max. memory is 11.5 GB. * Witness Printer took 51.12 ms. Allocated memory is still 1.3 GB. Free memory was 944.0 MB in the beginning and 938.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 1 error locations. SAFE Result, 2.0s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1583 SDtfs, 743 SDslu, 1056 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4745occurred in iteration=21, 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: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 1299 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 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.3s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...