./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/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 c5a3d22d49117f02662b197492bc1b16616a2878 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:12:52,973 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:12:52,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:12:52,986 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:12:52,986 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:12:52,987 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:12:52,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:12:52,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:12:52,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:12:52,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:12:52,994 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:12:52,994 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:12:52,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:12:52,995 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:12:52,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:12:52,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:12:52,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:12:53,000 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:12:53,002 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:12:53,003 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:12:53,004 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:12:53,006 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:12:53,008 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:12:53,008 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:12:53,008 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:12:53,009 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:12:53,010 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:12:53,011 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:12:53,011 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:12:53,012 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:12:53,013 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:12:53,014 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:12:53,014 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:12:53,014 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:12:53,015 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:12:53,015 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:12:53,016 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:12:53,029 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:12:53,029 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:12:53,030 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:12:53,030 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:12:53,031 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:12:53,031 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:12:53,031 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:12:53,031 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:12:53,031 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:12:53,031 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:12:53,032 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:12:53,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:12:53,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:12:53,034 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:12:53,034 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:12:53,034 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:12:53,035 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:12:53,035 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:12:53,035 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:12:53,035 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:12:53,035 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:12:53,035 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:12:53,036 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:12:53,036 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:12:53,036 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:12:53,036 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:12:53,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:12:53,037 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:12:53,037 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:12:53,037 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:12:53,037 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:12:53,037 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:12:53,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:12:53,038 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:12:53,038 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_d839d177-5b4c-44c1-97a3-105dd625c700/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-10-26 19:12:53,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:12:53,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:12:53,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:12:53,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:12:53,087 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:12:53,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:12:53,145 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/bin-2019/utaipan/data/ae51e3d0b/91e57d8cdc8e4a92831b714ec9f3ad74/FLAG00149edb7 [2018-10-26 19:12:53,546 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:12:53,547 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:12:53,555 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/bin-2019/utaipan/data/ae51e3d0b/91e57d8cdc8e4a92831b714ec9f3ad74/FLAG00149edb7 [2018-10-26 19:12:53,567 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/bin-2019/utaipan/data/ae51e3d0b/91e57d8cdc8e4a92831b714ec9f3ad74 [2018-10-26 19:12:53,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:12:53,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:12:53,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:12:53,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:12:53,576 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:12:53,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:12:53" (1/1) ... [2018-10-26 19:12:53,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f0132f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53, skipping insertion in model container [2018-10-26 19:12:53,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:12:53" (1/1) ... [2018-10-26 19:12:53,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:12:53,619 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:12:53,777 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:12:53,780 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:12:53,810 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:12:53,824 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:12:53,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53 WrapperNode [2018-10-26 19:12:53,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:12:53,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:12:53,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:12:53,826 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:12:53,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53" (1/1) ... [2018-10-26 19:12:53,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53" (1/1) ... [2018-10-26 19:12:53,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:12:53,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:12:53,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:12:53,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:12:53,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53" (1/1) ... [2018-10-26 19:12:53,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53" (1/1) ... [2018-10-26 19:12:53,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53" (1/1) ... [2018-10-26 19:12:53,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53" (1/1) ... [2018-10-26 19:12:53,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53" (1/1) ... [2018-10-26 19:12:53,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53" (1/1) ... [2018-10-26 19:12:53,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53" (1/1) ... [2018-10-26 19:12:53,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:12:53,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:12:53,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:12:53,910 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:12:53,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/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-10-26 19:12:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:12:54,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:12:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:12:54,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:12:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:12:54,062 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:12:54,641 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:12:54,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:12:54 BoogieIcfgContainer [2018-10-26 19:12:54,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:12:54,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:12:54,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:12:54,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:12:54,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:12:53" (1/3) ... [2018-10-26 19:12:54,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250ea60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:12:54, skipping insertion in model container [2018-10-26 19:12:54,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:53" (2/3) ... [2018-10-26 19:12:54,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250ea60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:12:54, skipping insertion in model container [2018-10-26 19:12:54,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:12:54" (3/3) ... [2018-10-26 19:12:54,650 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:12:54,658 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:12:54,664 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:12:54,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:12:54,707 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:12:54,707 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:12:54,708 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:12:54,708 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:12:54,708 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:12:54,708 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:12:54,708 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:12:54,709 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:12:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-10-26 19:12:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:12:54,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:54,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:54,736 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:54,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:54,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1553015003, now seen corresponding path program 1 times [2018-10-26 19:12:54,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:54,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:54,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:54,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:54,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:54,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:54,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:54,982 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:54,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:55,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:55,003 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2018-10-26 19:12:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:55,122 INFO L93 Difference]: Finished difference Result 113 states and 200 transitions. [2018-10-26 19:12:55,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:55,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:12:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:55,137 INFO L225 Difference]: With dead ends: 113 [2018-10-26 19:12:55,137 INFO L226 Difference]: Without dead ends: 98 [2018-10-26 19:12:55,140 INFO L605 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-10-26 19:12:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-26 19:12:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 67. [2018-10-26 19:12:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-26 19:12:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2018-10-26 19:12:55,186 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2018-10-26 19:12:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:55,186 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2018-10-26 19:12:55,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2018-10-26 19:12:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:12:55,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:55,188 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:55,188 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:55,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:55,189 INFO L82 PathProgramCache]: Analyzing trace with hash -35332899, now seen corresponding path program 1 times [2018-10-26 19:12:55,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:55,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:55,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,190 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:55,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:55,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:55,303 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:55,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:55,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:55,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:55,308 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand 3 states. [2018-10-26 19:12:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:55,361 INFO L93 Difference]: Finished difference Result 160 states and 295 transitions. [2018-10-26 19:12:55,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:55,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:12:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:55,363 INFO L225 Difference]: With dead ends: 160 [2018-10-26 19:12:55,363 INFO L226 Difference]: Without dead ends: 98 [2018-10-26 19:12:55,364 INFO L605 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-10-26 19:12:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-26 19:12:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-10-26 19:12:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-26 19:12:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 175 transitions. [2018-10-26 19:12:55,378 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 175 transitions. Word has length 25 [2018-10-26 19:12:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:55,379 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 175 transitions. [2018-10-26 19:12:55,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 175 transitions. [2018-10-26 19:12:55,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:12:55,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:55,380 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:55,380 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:55,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:55,381 INFO L82 PathProgramCache]: Analyzing trace with hash 899036922, now seen corresponding path program 1 times [2018-10-26 19:12:55,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,382 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:55,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:55,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:55,454 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:55,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:55,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:55,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:55,455 INFO L87 Difference]: Start difference. First operand 96 states and 175 transitions. Second operand 3 states. [2018-10-26 19:12:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:55,490 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2018-10-26 19:12:55,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:55,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:12:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:55,491 INFO L225 Difference]: With dead ends: 148 [2018-10-26 19:12:55,492 INFO L226 Difference]: Without dead ends: 102 [2018-10-26 19:12:55,492 INFO L605 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-10-26 19:12:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-26 19:12:55,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-26 19:12:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-26 19:12:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 178 transitions. [2018-10-26 19:12:55,502 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 178 transitions. Word has length 26 [2018-10-26 19:12:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:55,502 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 178 transitions. [2018-10-26 19:12:55,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 178 transitions. [2018-10-26 19:12:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:12:55,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:55,504 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:55,504 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:55,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:55,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1095107784, now seen corresponding path program 1 times [2018-10-26 19:12:55,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:55,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:55,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:55,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:55,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:55,591 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:55,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:55,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:55,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:55,591 INFO L87 Difference]: Start difference. First operand 100 states and 178 transitions. Second operand 3 states. [2018-10-26 19:12:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:55,623 INFO L93 Difference]: Finished difference Result 189 states and 341 transitions. [2018-10-26 19:12:55,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:55,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:12:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:55,625 INFO L225 Difference]: With dead ends: 189 [2018-10-26 19:12:55,625 INFO L226 Difference]: Without dead ends: 187 [2018-10-26 19:12:55,625 INFO L605 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-10-26 19:12:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-26 19:12:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 131. [2018-10-26 19:12:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-26 19:12:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 235 transitions. [2018-10-26 19:12:55,637 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 235 transitions. Word has length 26 [2018-10-26 19:12:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:55,637 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 235 transitions. [2018-10-26 19:12:55,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 235 transitions. [2018-10-26 19:12:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:12:55,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:55,639 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:55,639 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:55,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1611511610, now seen corresponding path program 1 times [2018-10-26 19:12:55,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:55,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:55,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,641 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:55,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:55,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:55,701 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:55,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:55,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:55,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:55,702 INFO L87 Difference]: Start difference. First operand 131 states and 235 transitions. Second operand 3 states. [2018-10-26 19:12:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:55,755 INFO L93 Difference]: Finished difference Result 311 states and 565 transitions. [2018-10-26 19:12:55,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:55,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:12:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:55,758 INFO L225 Difference]: With dead ends: 311 [2018-10-26 19:12:55,758 INFO L226 Difference]: Without dead ends: 189 [2018-10-26 19:12:55,759 INFO L605 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-10-26 19:12:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-26 19:12:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-10-26 19:12:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-26 19:12:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 335 transitions. [2018-10-26 19:12:55,771 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 335 transitions. Word has length 26 [2018-10-26 19:12:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:55,771 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 335 transitions. [2018-10-26 19:12:55,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 335 transitions. [2018-10-26 19:12:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:12:55,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:55,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:55,773 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:55,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:55,773 INFO L82 PathProgramCache]: Analyzing trace with hash 411609490, now seen corresponding path program 1 times [2018-10-26 19:12:55,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:55,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:55,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,775 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:55,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:55,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:55,855 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:55,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:55,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:55,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:55,856 INFO L87 Difference]: Start difference. First operand 187 states and 335 transitions. Second operand 3 states. [2018-10-26 19:12:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:55,921 INFO L93 Difference]: Finished difference Result 280 states and 500 transitions. [2018-10-26 19:12:55,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:55,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:12:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:55,923 INFO L225 Difference]: With dead ends: 280 [2018-10-26 19:12:55,924 INFO L226 Difference]: Without dead ends: 191 [2018-10-26 19:12:55,924 INFO L605 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-10-26 19:12:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-26 19:12:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-10-26 19:12:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-26 19:12:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 335 transitions. [2018-10-26 19:12:55,940 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 335 transitions. Word has length 27 [2018-10-26 19:12:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:55,941 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 335 transitions. [2018-10-26 19:12:55,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 335 transitions. [2018-10-26 19:12:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:12:55,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:55,942 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:55,942 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:55,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:55,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1582535216, now seen corresponding path program 1 times [2018-10-26 19:12:55,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:55,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:55,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:55,944 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:56,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:56,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:56,032 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:56,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:56,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:56,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:56,033 INFO L87 Difference]: Start difference. First operand 189 states and 335 transitions. Second operand 3 states. [2018-10-26 19:12:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:56,098 INFO L93 Difference]: Finished difference Result 357 states and 641 transitions. [2018-10-26 19:12:56,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:56,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:12:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:56,101 INFO L225 Difference]: With dead ends: 357 [2018-10-26 19:12:56,101 INFO L226 Difference]: Without dead ends: 355 [2018-10-26 19:12:56,101 INFO L605 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-10-26 19:12:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-26 19:12:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 253. [2018-10-26 19:12:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-26 19:12:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 447 transitions. [2018-10-26 19:12:56,132 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 447 transitions. Word has length 27 [2018-10-26 19:12:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:56,132 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 447 transitions. [2018-10-26 19:12:56,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 447 transitions. [2018-10-26 19:12:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:12:56,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:56,146 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:56,146 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:56,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:56,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1124084178, now seen corresponding path program 1 times [2018-10-26 19:12:56,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:56,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:56,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:56,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:56,148 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:56,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:56,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:56,256 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:56,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:56,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:56,257 INFO L87 Difference]: Start difference. First operand 253 states and 447 transitions. Second operand 3 states. [2018-10-26 19:12:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:56,335 INFO L93 Difference]: Finished difference Result 605 states and 1077 transitions. [2018-10-26 19:12:56,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:56,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:12:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:56,338 INFO L225 Difference]: With dead ends: 605 [2018-10-26 19:12:56,338 INFO L226 Difference]: Without dead ends: 363 [2018-10-26 19:12:56,339 INFO L605 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-10-26 19:12:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-26 19:12:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2018-10-26 19:12:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-26 19:12:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 635 transitions. [2018-10-26 19:12:56,359 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 635 transitions. Word has length 27 [2018-10-26 19:12:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:56,360 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 635 transitions. [2018-10-26 19:12:56,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 635 transitions. [2018-10-26 19:12:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:12:56,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:56,367 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:56,368 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:56,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:56,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1813738673, now seen corresponding path program 1 times [2018-10-26 19:12:56,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:56,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:56,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:56,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:56,369 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:56,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:56,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:56,467 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:56,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:56,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:56,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:56,467 INFO L87 Difference]: Start difference. First operand 361 states and 635 transitions. Second operand 3 states. [2018-10-26 19:12:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:56,559 INFO L93 Difference]: Finished difference Result 541 states and 949 transitions. [2018-10-26 19:12:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:56,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 19:12:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:56,561 INFO L225 Difference]: With dead ends: 541 [2018-10-26 19:12:56,561 INFO L226 Difference]: Without dead ends: 367 [2018-10-26 19:12:56,562 INFO L605 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-10-26 19:12:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-26 19:12:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2018-10-26 19:12:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-26 19:12:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 635 transitions. [2018-10-26 19:12:56,578 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 635 transitions. Word has length 28 [2018-10-26 19:12:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:56,579 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 635 transitions. [2018-10-26 19:12:56,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 635 transitions. [2018-10-26 19:12:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:12:56,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:56,580 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:56,580 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:56,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:56,586 INFO L82 PathProgramCache]: Analyzing trace with hash 487083917, now seen corresponding path program 1 times [2018-10-26 19:12:56,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:56,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:56,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:56,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:56,587 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:56,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:56,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:56,622 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:56,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:56,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:56,623 INFO L87 Difference]: Start difference. First operand 365 states and 635 transitions. Second operand 3 states. [2018-10-26 19:12:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:56,690 INFO L93 Difference]: Finished difference Result 685 states and 1209 transitions. [2018-10-26 19:12:56,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:56,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 19:12:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:56,694 INFO L225 Difference]: With dead ends: 685 [2018-10-26 19:12:56,694 INFO L226 Difference]: Without dead ends: 683 [2018-10-26 19:12:56,695 INFO L605 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-10-26 19:12:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-10-26 19:12:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 497. [2018-10-26 19:12:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-10-26 19:12:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 855 transitions. [2018-10-26 19:12:56,716 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 855 transitions. Word has length 28 [2018-10-26 19:12:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:56,716 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 855 transitions. [2018-10-26 19:12:56,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 855 transitions. [2018-10-26 19:12:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:12:56,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:56,718 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:56,718 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:56,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1101263985, now seen corresponding path program 1 times [2018-10-26 19:12:56,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:56,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:56,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:56,720 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:56,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:56,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:56,815 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:56,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:56,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:56,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:56,816 INFO L87 Difference]: Start difference. First operand 497 states and 855 transitions. Second operand 3 states. [2018-10-26 19:12:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:56,932 INFO L93 Difference]: Finished difference Result 1189 states and 2057 transitions. [2018-10-26 19:12:56,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:56,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 19:12:56,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:56,936 INFO L225 Difference]: With dead ends: 1189 [2018-10-26 19:12:56,936 INFO L226 Difference]: Without dead ends: 707 [2018-10-26 19:12:56,937 INFO L605 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-10-26 19:12:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-10-26 19:12:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 705. [2018-10-26 19:12:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-10-26 19:12:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1207 transitions. [2018-10-26 19:12:56,963 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1207 transitions. Word has length 28 [2018-10-26 19:12:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:56,964 INFO L481 AbstractCegarLoop]: Abstraction has 705 states and 1207 transitions. [2018-10-26 19:12:56,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1207 transitions. [2018-10-26 19:12:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:12:56,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:56,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:56,967 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:56,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2080054649, now seen corresponding path program 1 times [2018-10-26 19:12:56,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:56,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:56,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:56,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:56,968 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:57,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:57,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:57,015 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:57,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:57,016 INFO L87 Difference]: Start difference. First operand 705 states and 1207 transitions. Second operand 3 states. [2018-10-26 19:12:57,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:57,127 INFO L93 Difference]: Finished difference Result 1057 states and 1805 transitions. [2018-10-26 19:12:57,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:57,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:12:57,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:57,130 INFO L225 Difference]: With dead ends: 1057 [2018-10-26 19:12:57,131 INFO L226 Difference]: Without dead ends: 715 [2018-10-26 19:12:57,132 INFO L605 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-10-26 19:12:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-10-26 19:12:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2018-10-26 19:12:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-10-26 19:12:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1207 transitions. [2018-10-26 19:12:57,157 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1207 transitions. Word has length 29 [2018-10-26 19:12:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:57,157 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 1207 transitions. [2018-10-26 19:12:57,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1207 transitions. [2018-10-26 19:12:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:12:57,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:57,159 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:57,159 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:57,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash 220767941, now seen corresponding path program 1 times [2018-10-26 19:12:57,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:57,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:57,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:57,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:57,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:57,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:57,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:57,235 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:57,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:57,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:57,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:57,236 INFO L87 Difference]: Start difference. First operand 713 states and 1207 transitions. Second operand 3 states. [2018-10-26 19:12:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:57,359 INFO L93 Difference]: Finished difference Result 2077 states and 3513 transitions. [2018-10-26 19:12:57,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:57,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:12:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:57,365 INFO L225 Difference]: With dead ends: 2077 [2018-10-26 19:12:57,365 INFO L226 Difference]: Without dead ends: 1387 [2018-10-26 19:12:57,367 INFO L605 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-10-26 19:12:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2018-10-26 19:12:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1385. [2018-10-26 19:12:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-10-26 19:12:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2311 transitions. [2018-10-26 19:12:57,410 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2311 transitions. Word has length 29 [2018-10-26 19:12:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:57,411 INFO L481 AbstractCegarLoop]: Abstraction has 1385 states and 2311 transitions. [2018-10-26 19:12:57,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2311 transitions. [2018-10-26 19:12:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:12:57,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:57,414 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:57,414 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:57,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:57,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1809115843, now seen corresponding path program 1 times [2018-10-26 19:12:57,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:57,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:57,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:57,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:57,415 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:57,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:57,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:57,495 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:57,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:57,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:57,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:57,496 INFO L87 Difference]: Start difference. First operand 1385 states and 2311 transitions. Second operand 3 states. [2018-10-26 19:12:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:57,594 INFO L93 Difference]: Finished difference Result 1725 states and 2937 transitions. [2018-10-26 19:12:57,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:57,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:12:57,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:57,603 INFO L225 Difference]: With dead ends: 1725 [2018-10-26 19:12:57,603 INFO L226 Difference]: Without dead ends: 1723 [2018-10-26 19:12:57,604 INFO L605 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-10-26 19:12:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2018-10-26 19:12:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1385. [2018-10-26 19:12:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-10-26 19:12:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2295 transitions. [2018-10-26 19:12:57,652 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2295 transitions. Word has length 29 [2018-10-26 19:12:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:57,653 INFO L481 AbstractCegarLoop]: Abstraction has 1385 states and 2295 transitions. [2018-10-26 19:12:57,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2295 transitions. [2018-10-26 19:12:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:12:57,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:57,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:57,657 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:57,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:57,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1745914972, now seen corresponding path program 1 times [2018-10-26 19:12:57,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:57,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:57,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:57,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:57,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:57,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:57,731 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:57,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:57,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:57,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:57,732 INFO L87 Difference]: Start difference. First operand 1385 states and 2295 transitions. Second operand 3 states. [2018-10-26 19:12:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:57,852 INFO L93 Difference]: Finished difference Result 2557 states and 4313 transitions. [2018-10-26 19:12:57,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:57,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:12:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:57,863 INFO L225 Difference]: With dead ends: 2557 [2018-10-26 19:12:57,863 INFO L226 Difference]: Without dead ends: 2555 [2018-10-26 19:12:57,865 INFO L605 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-10-26 19:12:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2018-10-26 19:12:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 1945. [2018-10-26 19:12:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-10-26 19:12:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3159 transitions. [2018-10-26 19:12:57,953 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3159 transitions. Word has length 30 [2018-10-26 19:12:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:57,954 INFO L481 AbstractCegarLoop]: Abstraction has 1945 states and 3159 transitions. [2018-10-26 19:12:57,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3159 transitions. [2018-10-26 19:12:57,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:12:57,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:57,958 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:57,958 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:57,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:57,959 INFO L82 PathProgramCache]: Analyzing trace with hash 960704422, now seen corresponding path program 1 times [2018-10-26 19:12:57,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:57,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:57,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:57,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:57,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:58,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:58,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:58,039 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:58,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:58,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:58,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:58,040 INFO L87 Difference]: Start difference. First operand 1945 states and 3159 transitions. Second operand 3 states. [2018-10-26 19:12:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:58,190 INFO L93 Difference]: Finished difference Result 4637 states and 7577 transitions. [2018-10-26 19:12:58,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:58,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:12:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:58,201 INFO L225 Difference]: With dead ends: 4637 [2018-10-26 19:12:58,201 INFO L226 Difference]: Without dead ends: 2715 [2018-10-26 19:12:58,205 INFO L605 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-10-26 19:12:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2018-10-26 19:12:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2713. [2018-10-26 19:12:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2713 states. [2018-10-26 19:12:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 4391 transitions. [2018-10-26 19:12:58,284 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 4391 transitions. Word has length 30 [2018-10-26 19:12:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:58,285 INFO L481 AbstractCegarLoop]: Abstraction has 2713 states and 4391 transitions. [2018-10-26 19:12:58,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4391 transitions. [2018-10-26 19:12:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 19:12:58,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:58,290 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:58,290 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:58,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:58,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1711424506, now seen corresponding path program 1 times [2018-10-26 19:12:58,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:58,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:58,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:58,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:58,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:58,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:58,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:58,359 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:58,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:58,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:58,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:58,360 INFO L87 Difference]: Start difference. First operand 2713 states and 4391 transitions. Second operand 3 states. [2018-10-26 19:12:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:58,487 INFO L93 Difference]: Finished difference Result 4093 states and 6617 transitions. [2018-10-26 19:12:58,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:58,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 19:12:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:58,498 INFO L225 Difference]: With dead ends: 4093 [2018-10-26 19:12:58,498 INFO L226 Difference]: Without dead ends: 2763 [2018-10-26 19:12:58,500 INFO L605 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-10-26 19:12:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2018-10-26 19:12:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2761. [2018-10-26 19:12:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2018-10-26 19:12:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4423 transitions. [2018-10-26 19:12:58,575 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4423 transitions. Word has length 31 [2018-10-26 19:12:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:58,575 INFO L481 AbstractCegarLoop]: Abstraction has 2761 states and 4423 transitions. [2018-10-26 19:12:58,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4423 transitions. [2018-10-26 19:12:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 19:12:58,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:58,579 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:58,580 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:58,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:58,580 INFO L82 PathProgramCache]: Analyzing trace with hash -282720200, now seen corresponding path program 1 times [2018-10-26 19:12:58,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:58,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:58,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:58,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:58,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:58,650 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:58,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:58,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:58,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:58,651 INFO L87 Difference]: Start difference. First operand 2761 states and 4423 transitions. Second operand 3 states. [2018-10-26 19:12:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:58,794 INFO L93 Difference]: Finished difference Result 5005 states and 8169 transitions. [2018-10-26 19:12:58,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:58,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 19:12:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:58,811 INFO L225 Difference]: With dead ends: 5005 [2018-10-26 19:12:58,812 INFO L226 Difference]: Without dead ends: 5003 [2018-10-26 19:12:58,814 INFO L605 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-10-26 19:12:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-10-26 19:12:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 3913. [2018-10-26 19:12:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-10-26 19:12:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 6119 transitions. [2018-10-26 19:12:58,924 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 6119 transitions. Word has length 31 [2018-10-26 19:12:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:58,924 INFO L481 AbstractCegarLoop]: Abstraction has 3913 states and 6119 transitions. [2018-10-26 19:12:58,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 6119 transitions. [2018-10-26 19:12:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 19:12:58,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:58,931 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:58,931 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:58,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:58,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1871068102, now seen corresponding path program 1 times [2018-10-26 19:12:58,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:58,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:58,933 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:59,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:59,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:59,014 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:59,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:59,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:59,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:59,015 INFO L87 Difference]: Start difference. First operand 3913 states and 6119 transitions. Second operand 3 states. [2018-10-26 19:12:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:59,180 INFO L93 Difference]: Finished difference Result 9229 states and 14505 transitions. [2018-10-26 19:12:59,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:59,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 19:12:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:59,214 INFO L225 Difference]: With dead ends: 9229 [2018-10-26 19:12:59,214 INFO L226 Difference]: Without dead ends: 5387 [2018-10-26 19:12:59,221 INFO L605 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-10-26 19:12:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-10-26 19:12:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5385. [2018-10-26 19:12:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5385 states. [2018-10-26 19:12:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 8391 transitions. [2018-10-26 19:12:59,384 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 8391 transitions. Word has length 31 [2018-10-26 19:12:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:59,385 INFO L481 AbstractCegarLoop]: Abstraction has 5385 states and 8391 transitions. [2018-10-26 19:12:59,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 8391 transitions. [2018-10-26 19:12:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 19:12:59,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:59,392 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:59,392 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:59,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:59,392 INFO L82 PathProgramCache]: Analyzing trace with hash -174177477, now seen corresponding path program 1 times [2018-10-26 19:12:59,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:59,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:59,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:59,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:59,395 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:59,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:59,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:59,456 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:59,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:59,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:59,456 INFO L87 Difference]: Start difference. First operand 5385 states and 8391 transitions. Second operand 3 states. [2018-10-26 19:12:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:12:59,648 INFO L93 Difference]: Finished difference Result 8077 states and 12553 transitions. [2018-10-26 19:12:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:12:59,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 19:12:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:12:59,659 INFO L225 Difference]: With dead ends: 8077 [2018-10-26 19:12:59,660 INFO L226 Difference]: Without dead ends: 5451 [2018-10-26 19:12:59,664 INFO L605 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-10-26 19:12:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2018-10-26 19:12:59,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5449. [2018-10-26 19:12:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5449 states. [2018-10-26 19:12:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8391 transitions. [2018-10-26 19:12:59,795 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8391 transitions. Word has length 32 [2018-10-26 19:12:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:12:59,796 INFO L481 AbstractCegarLoop]: Abstraction has 5449 states and 8391 transitions. [2018-10-26 19:12:59,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:12:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8391 transitions. [2018-10-26 19:12:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 19:12:59,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:12:59,802 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:12:59,803 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:12:59,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:12:59,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2126645113, now seen corresponding path program 1 times [2018-10-26 19:12:59,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:12:59,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:12:59,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:12:59,806 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:12:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:12:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:12:59,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:12:59,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:12:59,871 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:12:59,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:12:59,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:12:59,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:12:59,872 INFO L87 Difference]: Start difference. First operand 5449 states and 8391 transitions. Second operand 3 states. [2018-10-26 19:13:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:00,054 INFO L93 Difference]: Finished difference Result 9741 states and 15305 transitions. [2018-10-26 19:13:00,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:00,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 19:13:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:00,071 INFO L225 Difference]: With dead ends: 9741 [2018-10-26 19:13:00,071 INFO L226 Difference]: Without dead ends: 9739 [2018-10-26 19:13:00,075 INFO L605 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-10-26 19:13:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2018-10-26 19:13:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 7817. [2018-10-26 19:13:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7817 states. [2018-10-26 19:13:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7817 states to 7817 states and 11719 transitions. [2018-10-26 19:13:00,241 INFO L78 Accepts]: Start accepts. Automaton has 7817 states and 11719 transitions. Word has length 32 [2018-10-26 19:13:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:00,241 INFO L481 AbstractCegarLoop]: Abstraction has 7817 states and 11719 transitions. [2018-10-26 19:13:00,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7817 states and 11719 transitions. [2018-10-26 19:13:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 19:13:00,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:00,253 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:00,253 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:00,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash 538297211, now seen corresponding path program 1 times [2018-10-26 19:13:00,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:00,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:00,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:00,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:00,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:00,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:00,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:00,326 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:00,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:00,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:00,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:00,327 INFO L87 Difference]: Start difference. First operand 7817 states and 11719 transitions. Second operand 3 states. [2018-10-26 19:13:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:00,564 INFO L93 Difference]: Finished difference Result 18317 states and 27593 transitions. [2018-10-26 19:13:00,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:00,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 19:13:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:00,593 INFO L225 Difference]: With dead ends: 18317 [2018-10-26 19:13:00,593 INFO L226 Difference]: Without dead ends: 10635 [2018-10-26 19:13:00,606 INFO L605 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-10-26 19:13:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10635 states. [2018-10-26 19:13:00,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10635 to 10633. [2018-10-26 19:13:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10633 states. [2018-10-26 19:13:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 15879 transitions. [2018-10-26 19:13:00,878 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 15879 transitions. Word has length 32 [2018-10-26 19:13:00,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:00,878 INFO L481 AbstractCegarLoop]: Abstraction has 10633 states and 15879 transitions. [2018-10-26 19:13:00,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 15879 transitions. [2018-10-26 19:13:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 19:13:00,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:00,890 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:00,890 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:00,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:00,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1501703535, now seen corresponding path program 1 times [2018-10-26 19:13:00,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:00,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:00,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:00,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:00,892 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:00,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:00,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:00,962 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:00,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:00,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:00,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:00,963 INFO L87 Difference]: Start difference. First operand 10633 states and 15879 transitions. Second operand 3 states. [2018-10-26 19:13:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:01,191 INFO L93 Difference]: Finished difference Result 15949 states and 23753 transitions. [2018-10-26 19:13:01,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:01,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-26 19:13:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:01,211 INFO L225 Difference]: With dead ends: 15949 [2018-10-26 19:13:01,211 INFO L226 Difference]: Without dead ends: 10763 [2018-10-26 19:13:01,221 INFO L605 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-10-26 19:13:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10763 states. [2018-10-26 19:13:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10763 to 10761. [2018-10-26 19:13:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10761 states. [2018-10-26 19:13:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 15879 transitions. [2018-10-26 19:13:01,438 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 15879 transitions. Word has length 33 [2018-10-26 19:13:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:01,438 INFO L481 AbstractCegarLoop]: Abstraction has 10761 states and 15879 transitions. [2018-10-26 19:13:01,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 15879 transitions. [2018-10-26 19:13:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 19:13:01,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:01,450 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:01,450 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:01,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:01,450 INFO L82 PathProgramCache]: Analyzing trace with hash -492441171, now seen corresponding path program 1 times [2018-10-26 19:13:01,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:01,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:01,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:01,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:01,451 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:01,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:01,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:01,514 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:01,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:01,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:01,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:01,515 INFO L87 Difference]: Start difference. First operand 10761 states and 15879 transitions. Second operand 3 states. [2018-10-26 19:13:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:01,861 INFO L93 Difference]: Finished difference Result 18957 states and 28553 transitions. [2018-10-26 19:13:01,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:01,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-26 19:13:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:01,892 INFO L225 Difference]: With dead ends: 18957 [2018-10-26 19:13:01,892 INFO L226 Difference]: Without dead ends: 18955 [2018-10-26 19:13:01,895 INFO L605 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-10-26 19:13:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2018-10-26 19:13:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 15625. [2018-10-26 19:13:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15625 states. [2018-10-26 19:13:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15625 states to 15625 states and 22407 transitions. [2018-10-26 19:13:02,213 INFO L78 Accepts]: Start accepts. Automaton has 15625 states and 22407 transitions. Word has length 33 [2018-10-26 19:13:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:02,213 INFO L481 AbstractCegarLoop]: Abstraction has 15625 states and 22407 transitions. [2018-10-26 19:13:02,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 15625 states and 22407 transitions. [2018-10-26 19:13:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 19:13:02,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:02,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:02,235 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:02,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:02,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2080789073, now seen corresponding path program 1 times [2018-10-26 19:13:02,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:02,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:02,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:02,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:02,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:02,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:02,311 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:02,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:02,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:02,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:02,312 INFO L87 Difference]: Start difference. First operand 15625 states and 22407 transitions. Second operand 3 states. [2018-10-26 19:13:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:02,652 INFO L93 Difference]: Finished difference Result 36365 states and 52361 transitions. [2018-10-26 19:13:02,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:02,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-26 19:13:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:02,691 INFO L225 Difference]: With dead ends: 36365 [2018-10-26 19:13:02,691 INFO L226 Difference]: Without dead ends: 21003 [2018-10-26 19:13:02,714 INFO L605 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-10-26 19:13:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21003 states. [2018-10-26 19:13:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21003 to 21001. [2018-10-26 19:13:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21001 states. [2018-10-26 19:13:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21001 states to 21001 states and 29959 transitions. [2018-10-26 19:13:03,170 INFO L78 Accepts]: Start accepts. Automaton has 21001 states and 29959 transitions. Word has length 33 [2018-10-26 19:13:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:03,170 INFO L481 AbstractCegarLoop]: Abstraction has 21001 states and 29959 transitions. [2018-10-26 19:13:03,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 21001 states and 29959 transitions. [2018-10-26 19:13:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 19:13:03,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:03,189 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:03,189 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:03,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:03,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1914407696, now seen corresponding path program 1 times [2018-10-26 19:13:03,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:03,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:03,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:03,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:03,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:03,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:03,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:03,263 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:03,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:03,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:03,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:03,264 INFO L87 Difference]: Start difference. First operand 21001 states and 29959 transitions. Second operand 3 states. [2018-10-26 19:13:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:03,534 INFO L93 Difference]: Finished difference Result 31501 states and 44809 transitions. [2018-10-26 19:13:03,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:03,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 19:13:03,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:03,565 INFO L225 Difference]: With dead ends: 31501 [2018-10-26 19:13:03,565 INFO L226 Difference]: Without dead ends: 21259 [2018-10-26 19:13:03,582 INFO L605 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-10-26 19:13:03,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2018-10-26 19:13:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 21257. [2018-10-26 19:13:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21257 states. [2018-10-26 19:13:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21257 states to 21257 states and 29959 transitions. [2018-10-26 19:13:04,157 INFO L78 Accepts]: Start accepts. Automaton has 21257 states and 29959 transitions. Word has length 34 [2018-10-26 19:13:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:04,158 INFO L481 AbstractCegarLoop]: Abstraction has 21257 states and 29959 transitions. [2018-10-26 19:13:04,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 21257 states and 29959 transitions. [2018-10-26 19:13:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 19:13:04,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:04,166 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:04,166 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:04,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash -79737010, now seen corresponding path program 1 times [2018-10-26 19:13:04,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:04,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:04,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:04,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:04,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:04,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:04,231 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:04,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:04,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:04,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:04,232 INFO L87 Difference]: Start difference. First operand 21257 states and 29959 transitions. Second operand 3 states. [2018-10-26 19:13:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:04,638 INFO L93 Difference]: Finished difference Result 36877 states and 53001 transitions. [2018-10-26 19:13:04,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:04,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 19:13:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:04,667 INFO L225 Difference]: With dead ends: 36877 [2018-10-26 19:13:04,667 INFO L226 Difference]: Without dead ends: 36875 [2018-10-26 19:13:04,674 INFO L605 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-10-26 19:13:04,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36875 states. [2018-10-26 19:13:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36875 to 31241. [2018-10-26 19:13:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31241 states. [2018-10-26 19:13:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 42759 transitions. [2018-10-26 19:13:05,441 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 42759 transitions. Word has length 34 [2018-10-26 19:13:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:05,441 INFO L481 AbstractCegarLoop]: Abstraction has 31241 states and 42759 transitions. [2018-10-26 19:13:05,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 42759 transitions. [2018-10-26 19:13:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 19:13:05,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:05,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:05,457 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:05,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:05,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1668084912, now seen corresponding path program 1 times [2018-10-26 19:13:05,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:05,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:05,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:05,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:05,459 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:05,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:05,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:05,527 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:05,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:05,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:05,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:05,528 INFO L87 Difference]: Start difference. First operand 31241 states and 42759 transitions. Second operand 3 states. [2018-10-26 19:13:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:06,001 INFO L93 Difference]: Finished difference Result 72205 states and 99081 transitions. [2018-10-26 19:13:06,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:06,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 19:13:06,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:06,034 INFO L225 Difference]: With dead ends: 72205 [2018-10-26 19:13:06,034 INFO L226 Difference]: Without dead ends: 41483 [2018-10-26 19:13:06,058 INFO L605 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-10-26 19:13:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41483 states. [2018-10-26 19:13:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41483 to 41481. [2018-10-26 19:13:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41481 states. [2018-10-26 19:13:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41481 states to 41481 states and 56327 transitions. [2018-10-26 19:13:06,948 INFO L78 Accepts]: Start accepts. Automaton has 41481 states and 56327 transitions. Word has length 34 [2018-10-26 19:13:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:06,948 INFO L481 AbstractCegarLoop]: Abstraction has 41481 states and 56327 transitions. [2018-10-26 19:13:06,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 41481 states and 56327 transitions. [2018-10-26 19:13:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 19:13:06,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:06,967 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:06,968 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:06,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:06,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1823335140, now seen corresponding path program 1 times [2018-10-26 19:13:06,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:06,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:06,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:06,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:06,969 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:07,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:07,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:07,035 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:07,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:07,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:07,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:07,036 INFO L87 Difference]: Start difference. First operand 41481 states and 56327 transitions. Second operand 3 states. [2018-10-26 19:13:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:07,632 INFO L93 Difference]: Finished difference Result 62221 states and 84233 transitions. [2018-10-26 19:13:07,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:07,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-26 19:13:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:07,668 INFO L225 Difference]: With dead ends: 62221 [2018-10-26 19:13:07,669 INFO L226 Difference]: Without dead ends: 41995 [2018-10-26 19:13:07,686 INFO L605 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-10-26 19:13:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41995 states. [2018-10-26 19:13:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41995 to 41993. [2018-10-26 19:13:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41993 states. [2018-10-26 19:13:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41993 states to 41993 states and 56327 transitions. [2018-10-26 19:13:08,711 INFO L78 Accepts]: Start accepts. Automaton has 41993 states and 56327 transitions. Word has length 35 [2018-10-26 19:13:08,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:08,711 INFO L481 AbstractCegarLoop]: Abstraction has 41993 states and 56327 transitions. [2018-10-26 19:13:08,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 41993 states and 56327 transitions. [2018-10-26 19:13:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 19:13:08,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:08,731 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:08,731 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:08,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:08,732 INFO L82 PathProgramCache]: Analyzing trace with hash -170809566, now seen corresponding path program 1 times [2018-10-26 19:13:08,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:08,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:08,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:08,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:08,735 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:08,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:08,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:08,803 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:08,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:08,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:08,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:08,804 INFO L87 Difference]: Start difference. First operand 41993 states and 56327 transitions. Second operand 3 states. [2018-10-26 19:13:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:09,712 INFO L93 Difference]: Finished difference Result 71693 states and 97801 transitions. [2018-10-26 19:13:09,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:09,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-26 19:13:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:09,779 INFO L225 Difference]: With dead ends: 71693 [2018-10-26 19:13:09,779 INFO L226 Difference]: Without dead ends: 71691 [2018-10-26 19:13:09,795 INFO L605 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-10-26 19:13:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71691 states. [2018-10-26 19:13:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71691 to 62473. [2018-10-26 19:13:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62473 states. [2018-10-26 19:13:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62473 states to 62473 states and 81415 transitions. [2018-10-26 19:13:11,078 INFO L78 Accepts]: Start accepts. Automaton has 62473 states and 81415 transitions. Word has length 35 [2018-10-26 19:13:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:11,079 INFO L481 AbstractCegarLoop]: Abstraction has 62473 states and 81415 transitions. [2018-10-26 19:13:11,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 62473 states and 81415 transitions. [2018-10-26 19:13:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 19:13:11,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:11,120 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:11,120 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:11,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1759157468, now seen corresponding path program 1 times [2018-10-26 19:13:11,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:11,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:11,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:11,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:11,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:11,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:11,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:11,190 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:11,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:11,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:11,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:11,191 INFO L87 Difference]: Start difference. First operand 62473 states and 81415 transitions. Second operand 3 states. [2018-10-26 19:13:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:12,012 INFO L93 Difference]: Finished difference Result 143373 states and 186889 transitions. [2018-10-26 19:13:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:12,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-26 19:13:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:12,085 INFO L225 Difference]: With dead ends: 143373 [2018-10-26 19:13:12,085 INFO L226 Difference]: Without dead ends: 81931 [2018-10-26 19:13:12,133 INFO L605 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-10-26 19:13:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81931 states. [2018-10-26 19:13:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81931 to 81929. [2018-10-26 19:13:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81929 states. [2018-10-26 19:13:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81929 states to 81929 states and 105479 transitions. [2018-10-26 19:13:13,785 INFO L78 Accepts]: Start accepts. Automaton has 81929 states and 105479 transitions. Word has length 35 [2018-10-26 19:13:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:13,785 INFO L481 AbstractCegarLoop]: Abstraction has 81929 states and 105479 transitions. [2018-10-26 19:13:13,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 81929 states and 105479 transitions. [2018-10-26 19:13:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 19:13:13,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:13,815 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:13,815 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:13,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:13,816 INFO L82 PathProgramCache]: Analyzing trace with hash -999913755, now seen corresponding path program 1 times [2018-10-26 19:13:13,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:13,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:13,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:13,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:13,820 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:13,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:13,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:13,891 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:13,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:13,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:13,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:13,891 INFO L87 Difference]: Start difference. First operand 81929 states and 105479 transitions. Second operand 3 states. [2018-10-26 19:13:15,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:15,007 INFO L93 Difference]: Finished difference Result 122893 states and 157705 transitions. [2018-10-26 19:13:15,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:15,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-26 19:13:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:15,074 INFO L225 Difference]: With dead ends: 122893 [2018-10-26 19:13:15,074 INFO L226 Difference]: Without dead ends: 82955 [2018-10-26 19:13:15,099 INFO L605 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-10-26 19:13:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82955 states. [2018-10-26 19:13:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82955 to 82953. [2018-10-26 19:13:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82953 states. [2018-10-26 19:13:16,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82953 states to 82953 states and 105479 transitions. [2018-10-26 19:13:16,314 INFO L78 Accepts]: Start accepts. Automaton has 82953 states and 105479 transitions. Word has length 36 [2018-10-26 19:13:16,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:16,315 INFO L481 AbstractCegarLoop]: Abstraction has 82953 states and 105479 transitions. [2018-10-26 19:13:16,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:16,315 INFO L276 IsEmpty]: Start isEmpty. Operand 82953 states and 105479 transitions. [2018-10-26 19:13:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 19:13:16,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:16,345 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:16,345 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:16,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:16,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1300908835, now seen corresponding path program 1 times [2018-10-26 19:13:16,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:16,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:16,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:16,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:16,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:16,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:16,411 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:16,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:16,412 INFO L87 Difference]: Start difference. First operand 82953 states and 105479 transitions. Second operand 3 states. [2018-10-26 19:13:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:18,148 INFO L93 Difference]: Finished difference Result 139277 states and 179209 transitions. [2018-10-26 19:13:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:18,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-26 19:13:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:18,268 INFO L225 Difference]: With dead ends: 139277 [2018-10-26 19:13:18,268 INFO L226 Difference]: Without dead ends: 139275 [2018-10-26 19:13:18,283 INFO L605 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-10-26 19:13:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139275 states. [2018-10-26 19:13:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139275 to 124937. [2018-10-26 19:13:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124937 states. [2018-10-26 19:13:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124937 states to 124937 states and 154631 transitions. [2018-10-26 19:13:20,549 INFO L78 Accepts]: Start accepts. Automaton has 124937 states and 154631 transitions. Word has length 36 [2018-10-26 19:13:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:20,549 INFO L481 AbstractCegarLoop]: Abstraction has 124937 states and 154631 transitions. [2018-10-26 19:13:20,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 124937 states and 154631 transitions. [2018-10-26 19:13:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 19:13:20,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:20,616 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:20,616 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:20,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash -287439067, now seen corresponding path program 1 times [2018-10-26 19:13:20,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:20,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:20,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:20,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:20,620 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:20,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:20,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:20,699 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:20,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:20,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:20,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:20,699 INFO L87 Difference]: Start difference. First operand 124937 states and 154631 transitions. Second operand 3 states. [2018-10-26 19:13:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:22,716 INFO L93 Difference]: Finished difference Result 284685 states and 351241 transitions. [2018-10-26 19:13:22,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:22,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-26 19:13:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:22,874 INFO L225 Difference]: With dead ends: 284685 [2018-10-26 19:13:22,874 INFO L226 Difference]: Without dead ends: 161803 [2018-10-26 19:13:22,958 INFO L605 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-10-26 19:13:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161803 states. [2018-10-26 19:13:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161803 to 161801. [2018-10-26 19:13:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161801 states. [2018-10-26 19:13:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161801 states to 161801 states and 196615 transitions. [2018-10-26 19:13:29,620 INFO L78 Accepts]: Start accepts. Automaton has 161801 states and 196615 transitions. Word has length 36 [2018-10-26 19:13:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:29,620 INFO L481 AbstractCegarLoop]: Abstraction has 161801 states and 196615 transitions. [2018-10-26 19:13:29,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:29,620 INFO L276 IsEmpty]: Start isEmpty. Operand 161801 states and 196615 transitions. [2018-10-26 19:13:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 19:13:29,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:29,682 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:29,683 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:29,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:29,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1673684057, now seen corresponding path program 1 times [2018-10-26 19:13:29,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:29,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:29,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:29,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:29,684 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:29,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:29,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:29,763 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:29,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:29,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:29,763 INFO L87 Difference]: Start difference. First operand 161801 states and 196615 transitions. Second operand 3 states. [2018-10-26 19:13:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:31,680 INFO L93 Difference]: Finished difference Result 242701 states and 293897 transitions. [2018-10-26 19:13:31,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:31,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-26 19:13:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:31,846 INFO L225 Difference]: With dead ends: 242701 [2018-10-26 19:13:31,846 INFO L226 Difference]: Without dead ends: 163851 [2018-10-26 19:13:31,909 INFO L605 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-10-26 19:13:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163851 states. [2018-10-26 19:13:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163851 to 163849. [2018-10-26 19:13:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163849 states. [2018-10-26 19:13:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163849 states to 163849 states and 196615 transitions. [2018-10-26 19:13:35,022 INFO L78 Accepts]: Start accepts. Automaton has 163849 states and 196615 transitions. Word has length 37 [2018-10-26 19:13:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:35,022 INFO L481 AbstractCegarLoop]: Abstraction has 163849 states and 196615 transitions. [2018-10-26 19:13:35,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 163849 states and 196615 transitions. [2018-10-26 19:13:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 19:13:35,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:35,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:35,101 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:35,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:35,102 INFO L82 PathProgramCache]: Analyzing trace with hash -320460649, now seen corresponding path program 1 times [2018-10-26 19:13:35,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:35,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:35,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:35,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:35,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:35,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:35,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:35,171 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:35,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:35,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:35,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:35,172 INFO L87 Difference]: Start difference. First operand 163849 states and 196615 transitions. Second operand 3 states. [2018-10-26 19:13:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:39,318 INFO L93 Difference]: Finished difference Result 479245 states and 565257 transitions. [2018-10-26 19:13:39,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:39,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-26 19:13:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:39,619 INFO L225 Difference]: With dead ends: 479245 [2018-10-26 19:13:39,620 INFO L226 Difference]: Without dead ends: 319499 [2018-10-26 19:13:39,717 INFO L605 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-10-26 19:13:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319499 states. [2018-10-26 19:13:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319499 to 319497. [2018-10-26 19:13:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319497 states. [2018-10-26 19:13:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319497 states to 319497 states and 368647 transitions. [2018-10-26 19:13:45,623 INFO L78 Accepts]: Start accepts. Automaton has 319497 states and 368647 transitions. Word has length 37 [2018-10-26 19:13:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:45,623 INFO L481 AbstractCegarLoop]: Abstraction has 319497 states and 368647 transitions. [2018-10-26 19:13:45,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:13:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 319497 states and 368647 transitions. [2018-10-26 19:13:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 19:13:45,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:45,748 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:45,748 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:45,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1267887253, now seen corresponding path program 1 times [2018-10-26 19:13:45,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:45,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:45,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:45,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:45,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:45,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:45,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:45,777 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:13:45,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:13:45,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:13:45,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:13:45,777 INFO L87 Difference]: Start difference. First operand 319497 states and 368647 transitions. Second operand 3 states. [2018-10-26 19:13:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:51,125 INFO L93 Difference]: Finished difference Result 339981 states and 397321 transitions. [2018-10-26 19:13:51,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:13:51,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-26 19:13:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:51,423 INFO L225 Difference]: With dead ends: 339981 [2018-10-26 19:13:51,423 INFO L226 Difference]: Without dead ends: 339979 [2018-10-26 19:13:51,464 INFO L605 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-10-26 19:13:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339979 states. [2018-10-26 19:14:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339979 to 319497. [2018-10-26 19:14:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319497 states. [2018-10-26 19:14:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319497 states to 319497 states and 364551 transitions. [2018-10-26 19:14:03,016 INFO L78 Accepts]: Start accepts. Automaton has 319497 states and 364551 transitions. Word has length 37 [2018-10-26 19:14:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:14:03,017 INFO L481 AbstractCegarLoop]: Abstraction has 319497 states and 364551 transitions. [2018-10-26 19:14:03,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:14:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 319497 states and 364551 transitions. [2018-10-26 19:14:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 19:14:03,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:14:03,143 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:14:03,144 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:14:03,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:14:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1344129350, now seen corresponding path program 1 times [2018-10-26 19:14:03,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:14:03,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:03,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:14:03,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:03,145 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:14:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:03,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:14:03,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:14:03,162 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:14:03,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:14:03,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:14:03,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:14:03,163 INFO L87 Difference]: Start difference. First operand 319497 states and 364551 transitions. Second operand 3 states. [2018-10-26 19:14:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:14:09,892 INFO L93 Difference]: Finished difference Result 520203 states and 589832 transitions. [2018-10-26 19:14:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:14:09,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-26 19:14:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:14:10,353 INFO L225 Difference]: With dead ends: 520203 [2018-10-26 19:14:10,353 INFO L226 Difference]: Without dead ends: 520201 [2018-10-26 19:14:10,418 INFO L605 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-10-26 19:14:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520201 states. [2018-10-26 19:14:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520201 to 495625. [2018-10-26 19:14:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495625 states. [2018-10-26 19:14:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495625 states to 495625 states and 557063 transitions. [2018-10-26 19:14:18,548 INFO L78 Accepts]: Start accepts. Automaton has 495625 states and 557063 transitions. Word has length 38 [2018-10-26 19:14:18,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:14:18,549 INFO L481 AbstractCegarLoop]: Abstraction has 495625 states and 557063 transitions. [2018-10-26 19:14:18,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:14:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 495625 states and 557063 transitions. [2018-10-26 19:14:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 19:14:18,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:14:18,806 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:14:18,806 INFO L424 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:14:18,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:14:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1362490044, now seen corresponding path program 1 times [2018-10-26 19:14:18,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:14:18,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:18,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:14:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:18,808 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:14:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:18,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:14:18,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:14:18,862 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:14:18,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:14:18,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:14:18,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:14:18,863 INFO L87 Difference]: Start difference. First operand 495625 states and 557063 transitions. Second operand 3 states. [2018-10-26 19:14:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:14:33,473 INFO L93 Difference]: Finished difference Result 1118217 states and 1245191 transitions. [2018-10-26 19:14:33,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:14:33,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-26 19:14:33,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:14:33,474 INFO L225 Difference]: With dead ends: 1118217 [2018-10-26 19:14:33,474 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:14:33,902 INFO L605 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-10-26 19:14:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:14:33,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:14:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:14:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:14:33,903 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-10-26 19:14:33,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:14:33,904 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:14:33,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:14:33,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:14:33,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:14:33,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:14:34,056 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 19:14:34,056 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:14:34,057 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:14:34,057 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 19:14:34,057 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:14:34,057 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:14:34,057 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-10-26 19:14:34,057 INFO L425 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,057 INFO L425 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,057 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,057 INFO L425 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-10-26 19:14:34,057 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-10-26 19:14:34,057 INFO L425 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,058 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,059 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,059 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-26 19:14:34,059 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,059 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-26 19:14:34,059 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-10-26 19:14:34,059 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,059 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,059 INFO L428 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-10-26 19:14:34,059 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,059 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-26 19:14:34,059 INFO L425 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,060 INFO L425 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-10-26 19:14:34,060 INFO L421 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-10-26 19:14:34,060 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,060 INFO L425 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,060 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-26 19:14:34,060 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-10-26 19:14:34,060 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-10-26 19:14:34,060 INFO L425 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,060 INFO L425 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,060 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-10-26 19:14:34,060 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,073 INFO L425 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,073 INFO L425 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,073 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-10-26 19:14:34,073 INFO L428 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-10-26 19:14:34,073 INFO L425 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,073 INFO L425 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,073 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-10-26 19:14:34,073 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,073 INFO L425 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-10-26 19:14:34,074 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-10-26 19:14:34,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:14:34 BoogieIcfgContainer [2018-10-26 19:14:34,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:14:34,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:14:34,081 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:14:34,081 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:14:34,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:12:54" (3/4) ... [2018-10-26 19:14:34,093 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 19:14:34,103 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 19:14:34,103 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 19:14:34,116 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-26 19:14:34,117 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-26 19:14:34,117 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 19:14:34,199 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d839d177-5b4c-44c1-97a3-105dd625c700/bin-2019/utaipan/witness.graphml [2018-10-26 19:14:34,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:14:34,204 INFO L168 Benchmark]: Toolchain (without parser) took 100634.13 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 960.7 MB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-10-26 19:14:34,206 INFO L168 Benchmark]: CDTParser took 0.21 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-10-26 19:14:34,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.56 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 948.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:14:34,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.80 ms. Allocated memory is still 1.0 GB. Free memory is still 946.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:14:34,207 INFO L168 Benchmark]: Boogie Preprocessor took 55.61 ms. Allocated memory is still 1.0 GB. Free memory is still 946.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:14:34,207 INFO L168 Benchmark]: RCFGBuilder took 732.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:14:34,207 INFO L168 Benchmark]: TraceAbstraction took 99437.10 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-10-26 19:14:34,208 INFO L168 Benchmark]: Witness Printer took 123.05 ms. Allocated memory is still 6.3 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 144.3 kB). Peak memory consumption was 144.3 kB. Max. memory is 11.5 GB. [2018-10-26 19:14:34,210 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.56 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 948.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.80 ms. Allocated memory is still 1.0 GB. Free memory is still 946.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.61 ms. Allocated memory is still 1.0 GB. Free memory is still 946.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 732.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 99437.10 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 123.05 ms. Allocated memory is still 6.3 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 144.3 kB). Peak memory consumption was 144.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 1 error locations. SAFE Result, 99.3s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 47.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4609 SDtfs, 2290 SDslu, 3157 SDs, 0 SdLazy, 207 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=495625occurred in iteration=38, 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: 47.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 81961 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1191 ConstructedInterpolants, 0 QuantifiedInterpolants, 75887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...