./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/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 0f7b0b589689413087c164ce10eb80c902ee4046 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:05:58,033 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:05:58,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:05:58,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:05:58,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:05:58,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:05:58,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:05:58,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:05:58,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:05:58,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:05:58,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:05:58,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:05:58,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:05:58,048 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:05:58,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:05:58,049 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:05:58,049 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:05:58,050 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:05:58,052 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:05:58,053 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:05:58,053 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:05:58,054 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:05:58,056 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:05:58,056 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:05:58,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:05:58,057 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:05:58,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:05:58,058 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:05:58,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:05:58,059 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:05:58,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:05:58,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:05:58,060 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:05:58,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:05:58,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:05:58,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:05:58,062 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 14:05:58,072 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:05:58,072 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:05:58,072 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:05:58,073 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:05:58,073 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:05:58,073 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:05:58,073 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:05:58,073 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 14:05:58,073 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:05:58,073 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:05:58,074 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 14:05:58,074 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 14:05:58,074 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:05:58,074 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:05:58,074 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:05:58,074 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:05:58,075 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:05:58,075 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:05:58,075 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:05:58,075 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:05:58,075 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:05:58,075 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:05:58,075 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:05:58,076 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:05:58,076 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:05:58,076 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:05:58,076 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:05:58,076 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:05:58,076 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:05:58,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:05:58,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:05:58,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:05:58,076 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:05:58,077 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 14:05:58,077 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:05:58,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:05:58,077 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 14:05:58,077 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_33ec101b-e45d-4e53-bdfd-ab405769ffad/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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-11-23 14:05:58,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:05:58,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:05:58,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:05:58,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:05:58,109 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:05:58,109 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 14:05:58,144 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/data/755e14cb0/86619af5a3344f7299600728aa6d91ad/FLAG448d04f36 [2018-11-23 14:05:58,548 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:05:58,549 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 14:05:58,555 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/data/755e14cb0/86619af5a3344f7299600728aa6d91ad/FLAG448d04f36 [2018-11-23 14:05:58,564 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/data/755e14cb0/86619af5a3344f7299600728aa6d91ad [2018-11-23 14:05:58,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:05:58,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:05:58,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:05:58,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:05:58,569 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:05:58,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:05:58" (1/1) ... [2018-11-23 14:05:58,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22877cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58, skipping insertion in model container [2018-11-23 14:05:58,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:05:58" (1/1) ... [2018-11-23 14:05:58,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:05:58,594 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:05:58,698 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:05:58,700 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:05:58,718 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:05:58,728 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:05:58,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58 WrapperNode [2018-11-23 14:05:58,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:05:58,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:05:58,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:05:58,729 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:05:58,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58" (1/1) ... [2018-11-23 14:05:58,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58" (1/1) ... [2018-11-23 14:05:58,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:05:58,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:05:58,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:05:58,747 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:05:58,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58" (1/1) ... [2018-11-23 14:05:58,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58" (1/1) ... [2018-11-23 14:05:58,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58" (1/1) ... [2018-11-23 14:05:58,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58" (1/1) ... [2018-11-23 14:05:58,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58" (1/1) ... [2018-11-23 14:05:58,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58" (1/1) ... [2018-11-23 14:05:58,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58" (1/1) ... [2018-11-23 14:05:58,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:05:58,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:05:58,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:05:58,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:05:58,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:05:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:05:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:05:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:05:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:05:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:05:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:05:59,032 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:05:59,032 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 14:05:59,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:59 BoogieIcfgContainer [2018-11-23 14:05:59,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:05:59,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:05:59,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:05:59,036 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:05:59,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:05:58" (1/3) ... [2018-11-23 14:05:59,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737d7a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:05:59, skipping insertion in model container [2018-11-23 14:05:59,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:58" (2/3) ... [2018-11-23 14:05:59,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737d7a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:05:59, skipping insertion in model container [2018-11-23 14:05:59,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:59" (3/3) ... [2018-11-23 14:05:59,039 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 14:05:59,048 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:05:59,055 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:05:59,067 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:05:59,094 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:05:59,094 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:05:59,094 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:05:59,094 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:05:59,094 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:05:59,094 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:05:59,094 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:05:59,094 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:05:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-23 14:05:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:05:59,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:59,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:59,118 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:59,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:59,123 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2018-11-23 14:05:59,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:59,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:59,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:59,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:05:59,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:59,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:05:59,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:05:59,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,270 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2018-11-23 14:05:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:59,306 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2018-11-23 14:05:59,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:05:59,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 14:05:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:59,316 INFO L225 Difference]: With dead ends: 87 [2018-11-23 14:05:59,316 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 14:05:59,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 14:05:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-11-23 14:05:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 14:05:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2018-11-23 14:05:59,346 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2018-11-23 14:05:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:59,346 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2018-11-23 14:05:59,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:05:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2018-11-23 14:05:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:05:59,347 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:59,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:59,348 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:59,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:59,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2018-11-23 14:05:59,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:59,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:59,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:59,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:59,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:05:59,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:59,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:05:59,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:05:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,397 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2018-11-23 14:05:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:59,423 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2018-11-23 14:05:59,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:05:59,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 14:05:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:59,424 INFO L225 Difference]: With dead ends: 117 [2018-11-23 14:05:59,425 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 14:05:59,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 14:05:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-23 14:05:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 14:05:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2018-11-23 14:05:59,430 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2018-11-23 14:05:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:59,431 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2018-11-23 14:05:59,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:05:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2018-11-23 14:05:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 14:05:59,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:59,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:59,432 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:59,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2018-11-23 14:05:59,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:59,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:59,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:59,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:59,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:05:59,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:59,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:05:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:05:59,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,473 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2018-11-23 14:05:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:59,497 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2018-11-23 14:05:59,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:05:59,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 14:05:59,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:59,498 INFO L225 Difference]: With dead ends: 108 [2018-11-23 14:05:59,499 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 14:05:59,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 14:05:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-23 14:05:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 14:05:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2018-11-23 14:05:59,506 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2018-11-23 14:05:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:59,506 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2018-11-23 14:05:59,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:05:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-11-23 14:05:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 14:05:59,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:59,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:59,507 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:59,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:59,508 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2018-11-23 14:05:59,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:59,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:59,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:59,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:59,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:05:59,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:59,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:05:59,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:05:59,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,537 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2018-11-23 14:05:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:59,548 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2018-11-23 14:05:59,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:05:59,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 14:05:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:59,550 INFO L225 Difference]: With dead ends: 136 [2018-11-23 14:05:59,550 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 14:05:59,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 14:05:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-11-23 14:05:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 14:05:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2018-11-23 14:05:59,557 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2018-11-23 14:05:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:59,557 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2018-11-23 14:05:59,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:05:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2018-11-23 14:05:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 14:05:59,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:59,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:59,559 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:59,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2018-11-23 14:05:59,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:59,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:59,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:59,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:59,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:05:59,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:59,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:05:59,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:05:59,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,593 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2018-11-23 14:05:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:59,612 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2018-11-23 14:05:59,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:05:59,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 14:05:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:59,614 INFO L225 Difference]: With dead ends: 224 [2018-11-23 14:05:59,614 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 14:05:59,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 14:05:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-11-23 14:05:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 14:05:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2018-11-23 14:05:59,623 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2018-11-23 14:05:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:59,623 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2018-11-23 14:05:59,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:05:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2018-11-23 14:05:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:05:59,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:59,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:59,624 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:59,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:59,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2018-11-23 14:05:59,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:59,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:59,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:05:59,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:59,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:05:59,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:05:59,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,656 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2018-11-23 14:05:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:59,665 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2018-11-23 14:05:59,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:05:59,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 14:05:59,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:59,667 INFO L225 Difference]: With dead ends: 201 [2018-11-23 14:05:59,667 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 14:05:59,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 14:05:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-23 14:05:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 14:05:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2018-11-23 14:05:59,675 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2018-11-23 14:05:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:59,675 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2018-11-23 14:05:59,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:05:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2018-11-23 14:05:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:05:59,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:59,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:59,676 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:59,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:59,677 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2018-11-23 14:05:59,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:59,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:59,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:59,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:59,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:05:59,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:59,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:05:59,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:05:59,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,710 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2018-11-23 14:05:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:59,728 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2018-11-23 14:05:59,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:05:59,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 14:05:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:59,729 INFO L225 Difference]: With dead ends: 252 [2018-11-23 14:05:59,729 INFO L226 Difference]: Without dead ends: 250 [2018-11-23 14:05:59,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-23 14:05:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2018-11-23 14:05:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 14:05:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2018-11-23 14:05:59,736 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2018-11-23 14:05:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:59,737 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2018-11-23 14:05:59,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:05:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2018-11-23 14:05:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:05:59,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:59,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:59,738 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:59,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:59,738 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2018-11-23 14:05:59,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:59,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:59,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:59,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:59,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:05:59,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:59,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:05:59,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:05:59,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,760 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2018-11-23 14:05:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:59,784 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2018-11-23 14:05:59,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:05:59,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 14:05:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:59,785 INFO L225 Difference]: With dead ends: 432 [2018-11-23 14:05:59,786 INFO L226 Difference]: Without dead ends: 258 [2018-11-23 14:05:59,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-23 14:05:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-23 14:05:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 14:05:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2018-11-23 14:05:59,795 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2018-11-23 14:05:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:59,796 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2018-11-23 14:05:59,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:05:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2018-11-23 14:05:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:05:59,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:59,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:59,797 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:59,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2018-11-23 14:05:59,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:59,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:59,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:59,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:05:59,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:59,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:05:59,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:05:59,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,820 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2018-11-23 14:05:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:59,851 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2018-11-23 14:05:59,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:05:59,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 14:05:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:59,852 INFO L225 Difference]: With dead ends: 384 [2018-11-23 14:05:59,852 INFO L226 Difference]: Without dead ends: 262 [2018-11-23 14:05:59,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-23 14:05:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-11-23 14:05:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-23 14:05:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2018-11-23 14:05:59,861 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2018-11-23 14:05:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:59,861 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2018-11-23 14:05:59,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:05:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2018-11-23 14:05:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:05:59,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:59,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:59,862 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:59,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2018-11-23 14:05:59,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:59,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:59,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:59,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:59,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:05:59,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:59,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:05:59,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:05:59,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,896 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2018-11-23 14:05:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:59,931 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2018-11-23 14:05:59,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:05:59,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 14:05:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:59,933 INFO L225 Difference]: With dead ends: 476 [2018-11-23 14:05:59,933 INFO L226 Difference]: Without dead ends: 474 [2018-11-23 14:05:59,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-11-23 14:05:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2018-11-23 14:05:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-23 14:05:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2018-11-23 14:05:59,946 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2018-11-23 14:05:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:59,946 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2018-11-23 14:05:59,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:05:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2018-11-23 14:05:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:05:59,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:59,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:59,948 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:59,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2018-11-23 14:05:59,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:59,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:59,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:59,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:05:59,966 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:59,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:05:59,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:05:59,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:05:59,967 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2018-11-23 14:06:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:00,000 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2018-11-23 14:06:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:00,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 14:06:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:00,002 INFO L225 Difference]: With dead ends: 844 [2018-11-23 14:06:00,002 INFO L226 Difference]: Without dead ends: 498 [2018-11-23 14:06:00,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-23 14:06:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2018-11-23 14:06:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-11-23 14:06:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2018-11-23 14:06:00,016 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2018-11-23 14:06:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:00,017 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2018-11-23 14:06:00,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2018-11-23 14:06:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 14:06:00,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:00,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:00,018 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:00,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2018-11-23 14:06:00,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:00,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:00,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:00,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:00,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:00,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:00,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,048 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2018-11-23 14:06:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:00,063 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2018-11-23 14:06:00,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:00,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 14:06:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:00,065 INFO L225 Difference]: With dead ends: 744 [2018-11-23 14:06:00,065 INFO L226 Difference]: Without dead ends: 506 [2018-11-23 14:06:00,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-11-23 14:06:00,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2018-11-23 14:06:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-23 14:06:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2018-11-23 14:06:00,078 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2018-11-23 14:06:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:00,078 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2018-11-23 14:06:00,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2018-11-23 14:06:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 14:06:00,079 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:00,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:00,079 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:00,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:00,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2018-11-23 14:06:00,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:00,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:00,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:00,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:00,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:00,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:00,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,116 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2018-11-23 14:06:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:00,136 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2018-11-23 14:06:00,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:00,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 14:06:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:00,139 INFO L225 Difference]: With dead ends: 908 [2018-11-23 14:06:00,139 INFO L226 Difference]: Without dead ends: 906 [2018-11-23 14:06:00,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-11-23 14:06:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2018-11-23 14:06:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-11-23 14:06:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2018-11-23 14:06:00,155 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2018-11-23 14:06:00,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:00,155 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2018-11-23 14:06:00,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2018-11-23 14:06:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 14:06:00,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:00,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:00,157 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:00,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2018-11-23 14:06:00,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:00,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:00,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:00,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:00,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:00,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:00,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,180 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2018-11-23 14:06:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:00,214 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2018-11-23 14:06:00,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:00,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 14:06:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:00,216 INFO L225 Difference]: With dead ends: 1660 [2018-11-23 14:06:00,216 INFO L226 Difference]: Without dead ends: 970 [2018-11-23 14:06:00,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-11-23 14:06:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2018-11-23 14:06:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-23 14:06:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2018-11-23 14:06:00,236 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2018-11-23 14:06:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:00,236 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2018-11-23 14:06:00,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2018-11-23 14:06:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 14:06:00,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:00,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:00,238 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:00,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2018-11-23 14:06:00,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:00,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:00,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:00,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:00,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:00,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:00,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,260 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2018-11-23 14:06:00,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:00,278 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2018-11-23 14:06:00,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:00,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 14:06:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:00,280 INFO L225 Difference]: With dead ends: 1452 [2018-11-23 14:06:00,280 INFO L226 Difference]: Without dead ends: 986 [2018-11-23 14:06:00,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-11-23 14:06:00,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2018-11-23 14:06:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-11-23 14:06:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2018-11-23 14:06:00,301 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2018-11-23 14:06:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:00,301 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2018-11-23 14:06:00,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2018-11-23 14:06:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 14:06:00,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:00,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:00,303 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:00,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:00,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2018-11-23 14:06:00,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:00,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:00,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:00,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:00,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:00,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:00,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:00,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:00,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,332 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2018-11-23 14:06:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:00,370 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2018-11-23 14:06:00,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:00,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 14:06:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:00,373 INFO L225 Difference]: With dead ends: 1740 [2018-11-23 14:06:00,373 INFO L226 Difference]: Without dead ends: 1738 [2018-11-23 14:06:00,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-23 14:06:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2018-11-23 14:06:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2018-11-23 14:06:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2018-11-23 14:06:00,400 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2018-11-23 14:06:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:00,401 INFO L480 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2018-11-23 14:06:00,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2018-11-23 14:06:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 14:06:00,402 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:00,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:00,403 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:00,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:00,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2018-11-23 14:06:00,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:00,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:00,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:00,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:00,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:00,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:00,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:00,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:00,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,436 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2018-11-23 14:06:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:00,463 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2018-11-23 14:06:00,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:00,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 14:06:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:00,466 INFO L225 Difference]: With dead ends: 3276 [2018-11-23 14:06:00,466 INFO L226 Difference]: Without dead ends: 1898 [2018-11-23 14:06:00,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-11-23 14:06:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2018-11-23 14:06:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2018-11-23 14:06:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2018-11-23 14:06:00,503 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2018-11-23 14:06:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:00,503 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2018-11-23 14:06:00,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2018-11-23 14:06:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:06:00,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:00,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:00,506 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:00,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:00,506 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2018-11-23 14:06:00,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:00,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:00,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:00,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:00,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:00,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:00,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:00,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,524 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2018-11-23 14:06:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:00,560 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2018-11-23 14:06:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:00,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 14:06:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:00,564 INFO L225 Difference]: With dead ends: 2844 [2018-11-23 14:06:00,564 INFO L226 Difference]: Without dead ends: 1930 [2018-11-23 14:06:00,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-23 14:06:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2018-11-23 14:06:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-23 14:06:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2018-11-23 14:06:00,605 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2018-11-23 14:06:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:00,605 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2018-11-23 14:06:00,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2018-11-23 14:06:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:06:00,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:00,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:00,607 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:00,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:00,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2018-11-23 14:06:00,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:00,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:00,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:00,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:00,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:00,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:00,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:00,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,624 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2018-11-23 14:06:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:00,696 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2018-11-23 14:06:00,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:00,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 14:06:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:00,702 INFO L225 Difference]: With dead ends: 3340 [2018-11-23 14:06:00,702 INFO L226 Difference]: Without dead ends: 3338 [2018-11-23 14:06:00,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-23 14:06:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2018-11-23 14:06:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-11-23 14:06:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2018-11-23 14:06:00,750 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2018-11-23 14:06:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:00,750 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2018-11-23 14:06:00,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2018-11-23 14:06:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:06:00,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:00,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:00,753 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:00,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:00,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2018-11-23 14:06:00,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:00,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:00,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:00,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:00,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:00,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:00,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,788 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2018-11-23 14:06:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:00,839 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2018-11-23 14:06:00,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:00,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 14:06:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:00,846 INFO L225 Difference]: With dead ends: 6476 [2018-11-23 14:06:00,846 INFO L226 Difference]: Without dead ends: 3722 [2018-11-23 14:06:00,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-23 14:06:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2018-11-23 14:06:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2018-11-23 14:06:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2018-11-23 14:06:00,913 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2018-11-23 14:06:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:00,914 INFO L480 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2018-11-23 14:06:00,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2018-11-23 14:06:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 14:06:00,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:00,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:00,916 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:00,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:00,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2018-11-23 14:06:00,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:00,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:00,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:00,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:00,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:00,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:00,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:00,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:00,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:00,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:00,948 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2018-11-23 14:06:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:01,000 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2018-11-23 14:06:01,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:01,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 14:06:01,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:01,007 INFO L225 Difference]: With dead ends: 5580 [2018-11-23 14:06:01,007 INFO L226 Difference]: Without dead ends: 3786 [2018-11-23 14:06:01,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-11-23 14:06:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2018-11-23 14:06:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-11-23 14:06:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2018-11-23 14:06:01,077 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2018-11-23 14:06:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:01,078 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2018-11-23 14:06:01,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2018-11-23 14:06:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 14:06:01,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:01,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:01,080 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:01,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:01,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2018-11-23 14:06:01,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:01,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:01,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:01,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:01,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:01,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:01,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:01,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:01,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:01,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:01,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:01,096 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2018-11-23 14:06:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:01,187 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2018-11-23 14:06:01,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:01,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 14:06:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:01,205 INFO L225 Difference]: With dead ends: 10956 [2018-11-23 14:06:01,205 INFO L226 Difference]: Without dead ends: 7306 [2018-11-23 14:06:01,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2018-11-23 14:06:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2018-11-23 14:06:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-23 14:06:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2018-11-23 14:06:01,337 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2018-11-23 14:06:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:01,337 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2018-11-23 14:06:01,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2018-11-23 14:06:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 14:06:01,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:01,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:01,341 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:01,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:01,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2018-11-23 14:06:01,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:01,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:01,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:01,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:01,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:01,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:01,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:01,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:01,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:01,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:01,364 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2018-11-23 14:06:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:01,480 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2018-11-23 14:06:01,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:01,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 14:06:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:01,490 INFO L225 Difference]: With dead ends: 8076 [2018-11-23 14:06:01,490 INFO L226 Difference]: Without dead ends: 8074 [2018-11-23 14:06:01,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-23 14:06:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2018-11-23 14:06:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-23 14:06:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2018-11-23 14:06:01,658 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2018-11-23 14:06:01,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:01,658 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2018-11-23 14:06:01,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2018-11-23 14:06:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 14:06:01,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:01,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:01,663 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:01,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:01,663 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2018-11-23 14:06:01,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:01,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:01,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:01,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:01,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:01,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:01,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:01,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:01,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:01,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:01,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:01,680 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2018-11-23 14:06:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:01,803 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2018-11-23 14:06:01,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:01,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 14:06:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:01,816 INFO L225 Difference]: With dead ends: 12172 [2018-11-23 14:06:01,816 INFO L226 Difference]: Without dead ends: 12170 [2018-11-23 14:06:01,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-11-23 14:06:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2018-11-23 14:06:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-23 14:06:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2018-11-23 14:06:01,975 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2018-11-23 14:06:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:01,976 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2018-11-23 14:06:01,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2018-11-23 14:06:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 14:06:01,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:01,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:01,984 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:01,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2018-11-23 14:06:01,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:01,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:01,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:01,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:01,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:02,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-23 14:06:02,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:02,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:02,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:02,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:02,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:02,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:02,008 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2018-11-23 14:06:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:02,167 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2018-11-23 14:06:02,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:02,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 14:06:02,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:02,181 INFO L225 Difference]: With dead ends: 25228 [2018-11-23 14:06:02,182 INFO L226 Difference]: Without dead ends: 14218 [2018-11-23 14:06:02,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2018-11-23 14:06:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2018-11-23 14:06:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-11-23 14:06:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2018-11-23 14:06:02,529 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2018-11-23 14:06:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:02,530 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2018-11-23 14:06:02,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2018-11-23 14:06:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 14:06:02,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:02,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:02,544 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:02,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:02,544 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2018-11-23 14:06:02,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:02,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:02,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:02,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:02,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:02,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:02,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:02,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:02,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:02,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:02,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:02,560 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2018-11-23 14:06:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:02,782 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2018-11-23 14:06:02,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:02,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 14:06:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:02,803 INFO L225 Difference]: With dead ends: 21516 [2018-11-23 14:06:02,803 INFO L226 Difference]: Without dead ends: 14602 [2018-11-23 14:06:02,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2018-11-23 14:06:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2018-11-23 14:06:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2018-11-23 14:06:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2018-11-23 14:06:03,108 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2018-11-23 14:06:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:03,108 INFO L480 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2018-11-23 14:06:03,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2018-11-23 14:06:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 14:06:03,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:03,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:03,122 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:03,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:03,122 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2018-11-23 14:06:03,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:03,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:03,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:03,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:03,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:03,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:03,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:03,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:03,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:03,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:03,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:03,136 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2018-11-23 14:06:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:03,444 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2018-11-23 14:06:03,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:03,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 14:06:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:03,463 INFO L225 Difference]: With dead ends: 23562 [2018-11-23 14:06:03,463 INFO L226 Difference]: Without dead ends: 23560 [2018-11-23 14:06:03,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2018-11-23 14:06:03,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2018-11-23 14:06:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2018-11-23 14:06:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2018-11-23 14:06:03,702 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2018-11-23 14:06:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:03,702 INFO L480 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2018-11-23 14:06:03,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2018-11-23 14:06:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 14:06:03,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:06:03,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:06:03,718 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:06:03,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:06:03,719 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2018-11-23 14:06:03,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:06:03,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:03,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:06:03,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:06:03,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:06:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:06:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:06:03,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:06:03,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:06:03,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:06:03,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:06:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:06:03,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:03,740 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2018-11-23 14:06:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:06:03,998 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2018-11-23 14:06:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:06:03,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 14:06:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:06:03,999 INFO L225 Difference]: With dead ends: 50184 [2018-11-23 14:06:03,999 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 14:06:04,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:06:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 14:06:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 14:06:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 14:06:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 14:06:04,032 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-23 14:06:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:06:04,032 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:06:04,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:06:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:06:04,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 14:06:04,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 14:06:04,068 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 14:06:04,068 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 14:06:04,068 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 14:06:04,068 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 14:06:04,068 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L451 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,069 INFO L451 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-11-23 14:06:04,070 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-11-23 14:06:04,070 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-23 14:06:04,070 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-11-23 14:06:04,070 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-23 14:06:04,070 INFO L444 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-11-23 14:06:04,070 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,070 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,070 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-23 14:06:04,070 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-11-23 14:06:04,070 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-23 14:06:04,070 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,070 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,070 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-23 14:06:04,071 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-11-23 14:06:04,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:06:04 BoogieIcfgContainer [2018-11-23 14:06:04,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:06:04,077 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:06:04,077 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:06:04,077 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:06:04,078 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:59" (3/4) ... [2018-11-23 14:06:04,081 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 14:06:04,087 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 14:06:04,087 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 14:06:04,092 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 14:06:04,092 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 14:06:04,092 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 14:06:04,134 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_33ec101b-e45d-4e53-bdfd-ab405769ffad/bin-2019/utaipan/witness.graphml [2018-11-23 14:06:04,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:06:04,135 INFO L168 Benchmark]: Toolchain (without parser) took 5569.31 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 519.0 MB). Free memory was 959.1 MB in the beginning and 986.7 MB in the end (delta: -27.6 MB). Peak memory consumption was 491.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:06:04,137 INFO L168 Benchmark]: CDTParser took 0.13 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-23 14:06:04,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.95 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:06:04,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.44 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-23 14:06:04,138 INFO L168 Benchmark]: Boogie Preprocessor took 58.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:06:04,138 INFO L168 Benchmark]: RCFGBuilder took 227.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:06:04,138 INFO L168 Benchmark]: TraceAbstraction took 5043.48 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 390.6 MB). Free memory was 1.1 GB in the beginning and 988.0 MB in the end (delta: 113.3 MB). Peak memory consumption was 503.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:06:04,139 INFO L168 Benchmark]: Witness Printer took 57.49 ms. Allocated memory is still 1.5 GB. Free memory was 988.0 MB in the beginning and 986.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:06:04,141 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.13 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 161.95 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.44 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. * Boogie Preprocessor took 58.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 227.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5043.48 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 390.6 MB). Free memory was 1.1 GB in the beginning and 988.0 MB in the end (delta: 113.3 MB). Peak memory consumption was 503.9 MB. Max. memory is 11.5 GB. * Witness Printer took 57.49 ms. Allocated memory is still 1.5 GB. Free memory was 988.0 MB in the beginning and 986.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 44 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 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.5s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...