./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/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 129b0578c0c64625cef50fbcfd5d128651ff3275 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:49:43,943 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:49:43,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:49:43,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:49:43,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:49:43,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:49:43,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:49:43,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:49:43,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:49:43,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:49:43,956 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:49:43,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:49:43,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:49:43,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:49:43,958 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:49:43,959 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:49:43,959 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:49:43,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:49:43,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:49:43,963 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:49:43,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:49:43,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:49:43,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:49:43,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:49:43,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:49:43,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:49:43,968 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:49:43,969 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:49:43,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:49:43,970 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:49:43,970 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:49:43,971 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:49:43,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:49:43,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:49:43,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:49:43,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:49:43,972 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 05:49:43,979 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:49:43,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:49:43,980 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:49:43,980 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:49:43,980 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:49:43,980 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:49:43,980 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:49:43,980 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 05:49:43,981 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:49:43,981 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:49:43,981 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 05:49:43,981 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 05:49:43,981 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:49:43,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:49:43,982 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:49:43,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:49:43,982 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:49:43,982 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:49:43,982 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:49:43,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:49:43,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:49:43,983 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:49:43,983 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:49:43,983 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:49:43,983 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:49:43,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:49:43,984 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:49:43,984 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:49:43,984 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:49:43,984 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:49:43,984 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:49:43,984 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:49:43,984 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:49:43,985 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 05:49:43,985 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:49:43,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:49:43,985 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 05:49:43,985 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_a04406ae-add1-488c-adbc-431566f7d48c/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2018-11-23 05:49:44,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:49:44,017 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:49:44,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:49:44,021 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:49:44,021 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:49:44,021 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 05:49:44,058 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/data/5e94cd1f2/7f18c8ffb5fc4465958e15a9138b2d79/FLAGebce7e69c [2018-11-23 05:49:44,466 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:49:44,467 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 05:49:44,472 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/data/5e94cd1f2/7f18c8ffb5fc4465958e15a9138b2d79/FLAGebce7e69c [2018-11-23 05:49:44,485 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/data/5e94cd1f2/7f18c8ffb5fc4465958e15a9138b2d79 [2018-11-23 05:49:44,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:49:44,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:49:44,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:49:44,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:49:44,494 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:49:44,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:49:44" (1/1) ... [2018-11-23 05:49:44,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbeed0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44, skipping insertion in model container [2018-11-23 05:49:44,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:49:44" (1/1) ... [2018-11-23 05:49:44,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:49:44,524 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:49:44,649 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:49:44,652 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:49:44,670 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:49:44,679 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:49:44,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44 WrapperNode [2018-11-23 05:49:44,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:49:44,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:49:44,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:49:44,680 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:49:44,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44" (1/1) ... [2018-11-23 05:49:44,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44" (1/1) ... [2018-11-23 05:49:44,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:49:44,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:49:44,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:49:44,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:49:44,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44" (1/1) ... [2018-11-23 05:49:44,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44" (1/1) ... [2018-11-23 05:49:44,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44" (1/1) ... [2018-11-23 05:49:44,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44" (1/1) ... [2018-11-23 05:49:44,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44" (1/1) ... [2018-11-23 05:49:44,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44" (1/1) ... [2018-11-23 05:49:44,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44" (1/1) ... [2018-11-23 05:49:44,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:49:44,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:49:44,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:49:44,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:49:44,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:49:44,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:49:44,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:49:44,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:49:44,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:49:44,788 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:49:44,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:49:45,053 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:49:45,053 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 05:49:45,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:49:45 BoogieIcfgContainer [2018-11-23 05:49:45,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:49:45,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:49:45,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:49:45,056 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:49:45,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:49:44" (1/3) ... [2018-11-23 05:49:45,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206871fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:49:45, skipping insertion in model container [2018-11-23 05:49:45,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:44" (2/3) ... [2018-11-23 05:49:45,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206871fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:49:45, skipping insertion in model container [2018-11-23 05:49:45,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:49:45" (3/3) ... [2018-11-23 05:49:45,058 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 05:49:45,064 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:49:45,069 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:49:45,080 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:49:45,101 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:49:45,101 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:49:45,102 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:49:45,102 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:49:45,102 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:49:45,102 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:49:45,102 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:49:45,102 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:49:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-23 05:49:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:49:45,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:45,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:45,120 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:45,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:45,123 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2018-11-23 05:49:45,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:45,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:45,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:45,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:45,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:45,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:45,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,267 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-11-23 05:49:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:45,326 INFO L93 Difference]: Finished difference Result 117 states and 210 transitions. [2018-11-23 05:49:45,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:45,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 05:49:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:45,337 INFO L225 Difference]: With dead ends: 117 [2018-11-23 05:49:45,338 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 05:49:45,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 05:49:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2018-11-23 05:49:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 05:49:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2018-11-23 05:49:45,369 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2018-11-23 05:49:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:45,370 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2018-11-23 05:49:45,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2018-11-23 05:49:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:49:45,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:45,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:45,371 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:45,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:45,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2018-11-23 05:49:45,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:45,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:45,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:45,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:45,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:45,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:45,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:45,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:45,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,426 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2018-11-23 05:49:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:45,451 INFO L93 Difference]: Finished difference Result 167 states and 312 transitions. [2018-11-23 05:49:45,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:45,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 05:49:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:45,453 INFO L225 Difference]: With dead ends: 167 [2018-11-23 05:49:45,453 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 05:49:45,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 05:49:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-23 05:49:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 05:49:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2018-11-23 05:49:45,460 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2018-11-23 05:49:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:45,460 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2018-11-23 05:49:45,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2018-11-23 05:49:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:49:45,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:45,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:45,461 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:45,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2018-11-23 05:49:45,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:45,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:45,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:45,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:45,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:45,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:45,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:45,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:45,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,496 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2018-11-23 05:49:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:45,518 INFO L93 Difference]: Finished difference Result 153 states and 279 transitions. [2018-11-23 05:49:45,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:45,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 05:49:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:45,519 INFO L225 Difference]: With dead ends: 153 [2018-11-23 05:49:45,519 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 05:49:45,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 05:49:45,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 05:49:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 05:49:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2018-11-23 05:49:45,525 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2018-11-23 05:49:45,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:45,526 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2018-11-23 05:49:45,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2018-11-23 05:49:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:49:45,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:45,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:45,527 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:45,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:45,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2018-11-23 05:49:45,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:45,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:45,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:45,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:45,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:45,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:45,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,572 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2018-11-23 05:49:45,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:45,589 INFO L93 Difference]: Finished difference Result 196 states and 360 transitions. [2018-11-23 05:49:45,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:45,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 05:49:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:45,590 INFO L225 Difference]: With dead ends: 196 [2018-11-23 05:49:45,590 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 05:49:45,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 05:49:45,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2018-11-23 05:49:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 05:49:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2018-11-23 05:49:45,600 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2018-11-23 05:49:45,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:45,600 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2018-11-23 05:49:45,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:45,600 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2018-11-23 05:49:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:49:45,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:45,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:45,601 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:45,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:45,602 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2018-11-23 05:49:45,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:45,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:45,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:45,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:45,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:45,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:45,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:45,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:45,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,631 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2018-11-23 05:49:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:45,666 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2018-11-23 05:49:45,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:45,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 05:49:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:45,667 INFO L225 Difference]: With dead ends: 324 [2018-11-23 05:49:45,667 INFO L226 Difference]: Without dead ends: 196 [2018-11-23 05:49:45,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-23 05:49:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-11-23 05:49:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-23 05:49:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2018-11-23 05:49:45,677 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2018-11-23 05:49:45,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:45,677 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2018-11-23 05:49:45,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2018-11-23 05:49:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 05:49:45,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:45,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:45,678 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:45,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:45,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2018-11-23 05:49:45,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:45,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:45,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:45,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:45,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:45,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:45,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:45,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:45,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,724 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2018-11-23 05:49:45,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:45,734 INFO L93 Difference]: Finished difference Result 291 states and 529 transitions. [2018-11-23 05:49:45,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:45,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 05:49:45,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:45,736 INFO L225 Difference]: With dead ends: 291 [2018-11-23 05:49:45,736 INFO L226 Difference]: Without dead ends: 198 [2018-11-23 05:49:45,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-23 05:49:45,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-11-23 05:49:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-23 05:49:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2018-11-23 05:49:45,744 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2018-11-23 05:49:45,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:45,744 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2018-11-23 05:49:45,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2018-11-23 05:49:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 05:49:45,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:45,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:45,746 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:45,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:45,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2018-11-23 05:49:45,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:45,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:45,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:45,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:45,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:45,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:45,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:45,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:45,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,771 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2018-11-23 05:49:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:45,802 INFO L93 Difference]: Finished difference Result 372 states and 680 transitions. [2018-11-23 05:49:45,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:45,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 05:49:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:45,804 INFO L225 Difference]: With dead ends: 372 [2018-11-23 05:49:45,804 INFO L226 Difference]: Without dead ends: 370 [2018-11-23 05:49:45,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-11-23 05:49:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2018-11-23 05:49:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-23 05:49:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2018-11-23 05:49:45,815 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2018-11-23 05:49:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:45,815 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2018-11-23 05:49:45,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2018-11-23 05:49:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 05:49:45,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:45,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:45,817 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:45,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:45,817 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2018-11-23 05:49:45,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:45,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:45,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:45,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:45,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:45,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:45,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:45,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:45,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,844 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2018-11-23 05:49:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:45,872 INFO L93 Difference]: Finished difference Result 632 states and 1144 transitions. [2018-11-23 05:49:45,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:45,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 05:49:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:45,875 INFO L225 Difference]: With dead ends: 632 [2018-11-23 05:49:45,875 INFO L226 Difference]: Without dead ends: 378 [2018-11-23 05:49:45,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-23 05:49:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2018-11-23 05:49:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-23 05:49:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2018-11-23 05:49:45,887 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2018-11-23 05:49:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:45,887 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2018-11-23 05:49:45,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2018-11-23 05:49:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 05:49:45,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:45,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:45,889 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:45,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2018-11-23 05:49:45,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:45,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:45,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:45,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:45,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:45,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:45,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:45,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:45,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,912 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2018-11-23 05:49:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:45,947 INFO L93 Difference]: Finished difference Result 564 states and 1008 transitions. [2018-11-23 05:49:45,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:45,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 05:49:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:45,949 INFO L225 Difference]: With dead ends: 564 [2018-11-23 05:49:45,949 INFO L226 Difference]: Without dead ends: 382 [2018-11-23 05:49:45,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-23 05:49:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-11-23 05:49:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-23 05:49:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2018-11-23 05:49:45,961 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2018-11-23 05:49:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:45,962 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2018-11-23 05:49:45,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2018-11-23 05:49:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 05:49:45,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:45,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:45,963 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:45,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2018-11-23 05:49:45,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:45,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:45,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:45,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:45,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:45,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:45,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:45,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:45,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:45,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:45,990 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2018-11-23 05:49:46,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:46,009 INFO L93 Difference]: Finished difference Result 716 states and 1288 transitions. [2018-11-23 05:49:46,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:46,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 05:49:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:46,012 INFO L225 Difference]: With dead ends: 716 [2018-11-23 05:49:46,012 INFO L226 Difference]: Without dead ends: 714 [2018-11-23 05:49:46,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-23 05:49:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2018-11-23 05:49:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-23 05:49:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2018-11-23 05:49:46,026 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2018-11-23 05:49:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:46,027 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2018-11-23 05:49:46,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2018-11-23 05:49:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 05:49:46,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:46,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:46,028 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:46,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:46,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2018-11-23 05:49:46,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:46,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:46,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:46,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:46,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:46,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:46,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:46,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:46,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,060 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2018-11-23 05:49:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:46,082 INFO L93 Difference]: Finished difference Result 1244 states and 2192 transitions. [2018-11-23 05:49:46,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:46,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 05:49:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:46,084 INFO L225 Difference]: With dead ends: 1244 [2018-11-23 05:49:46,084 INFO L226 Difference]: Without dead ends: 738 [2018-11-23 05:49:46,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-11-23 05:49:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-11-23 05:49:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-23 05:49:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2018-11-23 05:49:46,099 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2018-11-23 05:49:46,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:46,099 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2018-11-23 05:49:46,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2018-11-23 05:49:46,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 05:49:46,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:46,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:46,100 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:46,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:46,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2018-11-23 05:49:46,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:46,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:46,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:46,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:46,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:46,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:46,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:46,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:46,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,140 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2018-11-23 05:49:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:46,156 INFO L93 Difference]: Finished difference Result 1104 states and 1924 transitions. [2018-11-23 05:49:46,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:46,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 05:49:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:46,158 INFO L225 Difference]: With dead ends: 1104 [2018-11-23 05:49:46,158 INFO L226 Difference]: Without dead ends: 746 [2018-11-23 05:49:46,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-11-23 05:49:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-11-23 05:49:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-23 05:49:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2018-11-23 05:49:46,173 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2018-11-23 05:49:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:46,174 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2018-11-23 05:49:46,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2018-11-23 05:49:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 05:49:46,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:46,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:46,175 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:46,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:46,176 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2018-11-23 05:49:46,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:46,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:46,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:46,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:46,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:46,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:46,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:46,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:46,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,194 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2018-11-23 05:49:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:46,231 INFO L93 Difference]: Finished difference Result 1388 states and 2440 transitions. [2018-11-23 05:49:46,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:46,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 05:49:46,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:46,234 INFO L225 Difference]: With dead ends: 1388 [2018-11-23 05:49:46,234 INFO L226 Difference]: Without dead ends: 1386 [2018-11-23 05:49:46,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-11-23 05:49:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2018-11-23 05:49:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-23 05:49:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2018-11-23 05:49:46,254 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2018-11-23 05:49:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:46,254 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2018-11-23 05:49:46,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2018-11-23 05:49:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 05:49:46,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:46,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:46,256 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:46,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:46,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2018-11-23 05:49:46,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:46,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:46,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:46,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:46,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:46,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:46,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:46,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,288 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2018-11-23 05:49:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:46,318 INFO L93 Difference]: Finished difference Result 2460 states and 4200 transitions. [2018-11-23 05:49:46,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:46,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 05:49:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:46,321 INFO L225 Difference]: With dead ends: 2460 [2018-11-23 05:49:46,321 INFO L226 Difference]: Without dead ends: 1450 [2018-11-23 05:49:46,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-11-23 05:49:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2018-11-23 05:49:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2018-11-23 05:49:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2018-11-23 05:49:46,349 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2018-11-23 05:49:46,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:46,349 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2018-11-23 05:49:46,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2018-11-23 05:49:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 05:49:46,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:46,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:46,351 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:46,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:46,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2018-11-23 05:49:46,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:46,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:46,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:46,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:46,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:46,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:46,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:46,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,368 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2018-11-23 05:49:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:46,396 INFO L93 Difference]: Finished difference Result 2172 states and 3672 transitions. [2018-11-23 05:49:46,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:46,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 05:49:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:46,399 INFO L225 Difference]: With dead ends: 2172 [2018-11-23 05:49:46,399 INFO L226 Difference]: Without dead ends: 1466 [2018-11-23 05:49:46,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-11-23 05:49:46,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2018-11-23 05:49:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-11-23 05:49:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2018-11-23 05:49:46,449 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2018-11-23 05:49:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:46,449 INFO L480 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2018-11-23 05:49:46,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2018-11-23 05:49:46,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 05:49:46,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:46,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:46,451 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:46,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:46,451 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2018-11-23 05:49:46,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:46,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:46,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:46,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:46,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:46,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:46,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:46,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:46,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,476 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2018-11-23 05:49:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:46,508 INFO L93 Difference]: Finished difference Result 2700 states and 4616 transitions. [2018-11-23 05:49:46,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:46,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 05:49:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:46,513 INFO L225 Difference]: With dead ends: 2700 [2018-11-23 05:49:46,513 INFO L226 Difference]: Without dead ends: 2698 [2018-11-23 05:49:46,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-11-23 05:49:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2018-11-23 05:49:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-11-23 05:49:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2018-11-23 05:49:46,548 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2018-11-23 05:49:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:46,548 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2018-11-23 05:49:46,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2018-11-23 05:49:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 05:49:46,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:46,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:46,550 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:46,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:46,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2018-11-23 05:49:46,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:46,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:46,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:46,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:46,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:46,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:46,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:46,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:46,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,572 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2018-11-23 05:49:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:46,614 INFO L93 Difference]: Finished difference Result 4876 states and 8040 transitions. [2018-11-23 05:49:46,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:46,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 05:49:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:46,620 INFO L225 Difference]: With dead ends: 4876 [2018-11-23 05:49:46,620 INFO L226 Difference]: Without dead ends: 2858 [2018-11-23 05:49:46,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-11-23 05:49:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2018-11-23 05:49:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2018-11-23 05:49:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2018-11-23 05:49:46,672 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2018-11-23 05:49:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:46,672 INFO L480 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2018-11-23 05:49:46,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2018-11-23 05:49:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 05:49:46,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:46,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:46,675 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:46,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:46,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2018-11-23 05:49:46,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:46,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:46,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:46,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:46,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:46,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:46,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:46,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:46,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,704 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2018-11-23 05:49:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:46,744 INFO L93 Difference]: Finished difference Result 4284 states and 7000 transitions. [2018-11-23 05:49:46,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:46,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 05:49:46,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:46,750 INFO L225 Difference]: With dead ends: 4284 [2018-11-23 05:49:46,750 INFO L226 Difference]: Without dead ends: 2890 [2018-11-23 05:49:46,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2018-11-23 05:49:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2018-11-23 05:49:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2018-11-23 05:49:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2018-11-23 05:49:46,797 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2018-11-23 05:49:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:46,798 INFO L480 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2018-11-23 05:49:46,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2018-11-23 05:49:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 05:49:46,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:46,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:46,800 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:46,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:46,800 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2018-11-23 05:49:46,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:46,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-11-23 05:49:46,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:46,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:46,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:46,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:46,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:46,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,815 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2018-11-23 05:49:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:46,866 INFO L93 Difference]: Finished difference Result 5260 states and 8712 transitions. [2018-11-23 05:49:46,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:46,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 05:49:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:46,876 INFO L225 Difference]: With dead ends: 5260 [2018-11-23 05:49:46,876 INFO L226 Difference]: Without dead ends: 5258 [2018-11-23 05:49:46,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-11-23 05:49:46,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2018-11-23 05:49:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-11-23 05:49:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2018-11-23 05:49:46,941 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2018-11-23 05:49:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:46,941 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2018-11-23 05:49:46,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2018-11-23 05:49:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 05:49:46,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:46,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:46,945 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:46,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:46,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2018-11-23 05:49:46,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:46,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:46,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:46,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:46,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:46,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:46,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:46,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:46,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:46,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:46,967 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2018-11-23 05:49:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:47,035 INFO L93 Difference]: Finished difference Result 9676 states and 15368 transitions. [2018-11-23 05:49:47,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:47,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 05:49:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:47,050 INFO L225 Difference]: With dead ends: 9676 [2018-11-23 05:49:47,050 INFO L226 Difference]: Without dead ends: 5642 [2018-11-23 05:49:47,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:47,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2018-11-23 05:49:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2018-11-23 05:49:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2018-11-23 05:49:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2018-11-23 05:49:47,188 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2018-11-23 05:49:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:47,189 INFO L480 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2018-11-23 05:49:47,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2018-11-23 05:49:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 05:49:47,192 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:47,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:47,193 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:47,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:47,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2018-11-23 05:49:47,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:47,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:47,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:47,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:47,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:47,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:47,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:47,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:47,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:47,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:47,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:47,215 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2018-11-23 05:49:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:47,288 INFO L93 Difference]: Finished difference Result 8460 states and 13320 transitions. [2018-11-23 05:49:47,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:47,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 05:49:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:47,298 INFO L225 Difference]: With dead ends: 8460 [2018-11-23 05:49:47,298 INFO L226 Difference]: Without dead ends: 5706 [2018-11-23 05:49:47,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2018-11-23 05:49:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2018-11-23 05:49:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2018-11-23 05:49:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2018-11-23 05:49:47,418 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2018-11-23 05:49:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:47,419 INFO L480 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2018-11-23 05:49:47,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2018-11-23 05:49:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 05:49:47,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:47,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:47,424 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:47,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:47,424 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2018-11-23 05:49:47,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:47,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:47,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:47,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:47,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:47,468 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:47,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:47,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:47,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:47,468 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2018-11-23 05:49:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:47,614 INFO L93 Difference]: Finished difference Result 16716 states and 25928 transitions. [2018-11-23 05:49:47,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:47,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 05:49:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:47,636 INFO L225 Difference]: With dead ends: 16716 [2018-11-23 05:49:47,636 INFO L226 Difference]: Without dead ends: 11146 [2018-11-23 05:49:47,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-11-23 05:49:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2018-11-23 05:49:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-23 05:49:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2018-11-23 05:49:47,917 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2018-11-23 05:49:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:47,917 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2018-11-23 05:49:47,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2018-11-23 05:49:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 05:49:47,926 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:47,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:47,926 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:47,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:47,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2018-11-23 05:49:47,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:47,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:47,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:47,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:47,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:47,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:47,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:47,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:47,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:47,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:47,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:47,944 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2018-11-23 05:49:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:48,154 INFO L93 Difference]: Finished difference Result 13196 states and 20872 transitions. [2018-11-23 05:49:48,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:48,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 05:49:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:48,175 INFO L225 Difference]: With dead ends: 13196 [2018-11-23 05:49:48,175 INFO L226 Difference]: Without dead ends: 13194 [2018-11-23 05:49:48,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2018-11-23 05:49:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2018-11-23 05:49:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-23 05:49:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2018-11-23 05:49:48,413 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2018-11-23 05:49:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:48,413 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2018-11-23 05:49:48,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2018-11-23 05:49:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 05:49:48,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:48,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:48,422 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:48,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:48,422 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2018-11-23 05:49:48,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:48,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:48,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:48,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:48,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:48,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:48,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:48,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:48,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:48,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:48,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:48,436 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2018-11-23 05:49:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:48,677 INFO L93 Difference]: Finished difference Result 19852 states and 30856 transitions. [2018-11-23 05:49:48,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:48,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 05:49:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:48,708 INFO L225 Difference]: With dead ends: 19852 [2018-11-23 05:49:48,708 INFO L226 Difference]: Without dead ends: 19850 [2018-11-23 05:49:48,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2018-11-23 05:49:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2018-11-23 05:49:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16264 states. [2018-11-23 05:49:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 23942 transitions. [2018-11-23 05:49:49,024 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 23942 transitions. Word has length 33 [2018-11-23 05:49:49,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:49,025 INFO L480 AbstractCegarLoop]: Abstraction has 16264 states and 23942 transitions. [2018-11-23 05:49:49,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 23942 transitions. [2018-11-23 05:49:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 05:49:49,041 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:49,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:49,042 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:49,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:49,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1294610522, now seen corresponding path program 1 times [2018-11-23 05:49:49,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:49,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:49,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:49,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:49,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:49,075 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:49,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:49,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:49,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:49,076 INFO L87 Difference]: Start difference. First operand 16264 states and 23942 transitions. Second operand 3 states. [2018-11-23 05:49:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:49,318 INFO L93 Difference]: Finished difference Result 38028 states and 56456 transitions. [2018-11-23 05:49:49,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:49,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 05:49:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:49,350 INFO L225 Difference]: With dead ends: 38028 [2018-11-23 05:49:49,350 INFO L226 Difference]: Without dead ends: 21898 [2018-11-23 05:49:49,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2018-11-23 05:49:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 21896. [2018-11-23 05:49:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2018-11-23 05:49:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32262 transitions. [2018-11-23 05:49:49,806 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32262 transitions. Word has length 33 [2018-11-23 05:49:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:49,806 INFO L480 AbstractCegarLoop]: Abstraction has 21896 states and 32262 transitions. [2018-11-23 05:49:49,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32262 transitions. [2018-11-23 05:49:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:49:49,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:49,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:49,821 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:49,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash 210937712, now seen corresponding path program 1 times [2018-11-23 05:49:49,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:49,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:49,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:49,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:49,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:49,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:49,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:49,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:49,852 INFO L87 Difference]: Start difference. First operand 21896 states and 32262 transitions. Second operand 3 states. [2018-11-23 05:49:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:50,051 INFO L93 Difference]: Finished difference Result 33036 states and 48648 transitions. [2018-11-23 05:49:50,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:50,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 05:49:50,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:50,077 INFO L225 Difference]: With dead ends: 33036 [2018-11-23 05:49:50,077 INFO L226 Difference]: Without dead ends: 22282 [2018-11-23 05:49:50,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:50,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22282 states. [2018-11-23 05:49:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22282 to 22280. [2018-11-23 05:49:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2018-11-23 05:49:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 32518 transitions. [2018-11-23 05:49:50,329 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 32518 transitions. Word has length 34 [2018-11-23 05:49:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:50,330 INFO L480 AbstractCegarLoop]: Abstraction has 22280 states and 32518 transitions. [2018-11-23 05:49:50,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 32518 transitions. [2018-11-23 05:49:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:49:50,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:50,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:50,339 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:50,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1478006030, now seen corresponding path program 1 times [2018-11-23 05:49:50,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:50,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:50,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:50,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:50,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:50,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:50,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:50,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:50,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:50,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:50,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:50,367 INFO L87 Difference]: Start difference. First operand 22280 states and 32518 transitions. Second operand 3 states. [2018-11-23 05:49:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:50,685 INFO L93 Difference]: Finished difference Result 38924 states and 58120 transitions. [2018-11-23 05:49:50,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:50,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 05:49:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:50,717 INFO L225 Difference]: With dead ends: 38924 [2018-11-23 05:49:50,717 INFO L226 Difference]: Without dead ends: 38922 [2018-11-23 05:49:50,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2018-11-23 05:49:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 32776. [2018-11-23 05:49:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2018-11-23 05:49:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 46342 transitions. [2018-11-23 05:49:51,084 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 46342 transitions. Word has length 34 [2018-11-23 05:49:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:51,084 INFO L480 AbstractCegarLoop]: Abstraction has 32776 states and 46342 transitions. [2018-11-23 05:49:51,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 46342 transitions. [2018-11-23 05:49:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:49:51,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:51,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:51,099 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:51,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:51,099 INFO L82 PathProgramCache]: Analyzing trace with hash 822816560, now seen corresponding path program 1 times [2018-11-23 05:49:51,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:51,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:51,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:51,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:51,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:51,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:51,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:51,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:51,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:51,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:51,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:51,128 INFO L87 Difference]: Start difference. First operand 32776 states and 46342 transitions. Second operand 3 states. [2018-11-23 05:49:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:51,659 INFO L93 Difference]: Finished difference Result 75788 states and 107784 transitions. [2018-11-23 05:49:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:51,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 05:49:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:51,685 INFO L225 Difference]: With dead ends: 75788 [2018-11-23 05:49:51,685 INFO L226 Difference]: Without dead ends: 43530 [2018-11-23 05:49:51,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43530 states. [2018-11-23 05:49:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43530 to 43528. [2018-11-23 05:49:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43528 states. [2018-11-23 05:49:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 61446 transitions. [2018-11-23 05:49:52,176 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 61446 transitions. Word has length 34 [2018-11-23 05:49:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:52,176 INFO L480 AbstractCegarLoop]: Abstraction has 43528 states and 61446 transitions. [2018-11-23 05:49:52,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 61446 transitions. [2018-11-23 05:49:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 05:49:52,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:52,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:52,189 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:52,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:52,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1426668155, now seen corresponding path program 1 times [2018-11-23 05:49:52,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:52,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:52,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:52,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:52,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:52,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:52,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:52,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:52,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:52,217 INFO L87 Difference]: Start difference. First operand 43528 states and 61446 transitions. Second operand 3 states. [2018-11-23 05:49:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:52,661 INFO L93 Difference]: Finished difference Result 65292 states and 91912 transitions. [2018-11-23 05:49:52,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:52,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 05:49:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:52,686 INFO L225 Difference]: With dead ends: 65292 [2018-11-23 05:49:52,686 INFO L226 Difference]: Without dead ends: 44042 [2018-11-23 05:49:52,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44042 states. [2018-11-23 05:49:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44042 to 44040. [2018-11-23 05:49:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44040 states. [2018-11-23 05:49:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44040 states to 44040 states and 61446 transitions. [2018-11-23 05:49:53,149 INFO L78 Accepts]: Start accepts. Automaton has 44040 states and 61446 transitions. Word has length 35 [2018-11-23 05:49:53,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:53,149 INFO L480 AbstractCegarLoop]: Abstraction has 44040 states and 61446 transitions. [2018-11-23 05:49:53,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 44040 states and 61446 transitions. [2018-11-23 05:49:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 05:49:53,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:53,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:53,169 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:53,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash -262275587, now seen corresponding path program 1 times [2018-11-23 05:49:53,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:53,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:53,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:53,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:53,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:53,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:53,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:53,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:53,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:53,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:53,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:53,188 INFO L87 Difference]: Start difference. First operand 44040 states and 61446 transitions. Second operand 3 states. [2018-11-23 05:49:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:53,766 INFO L93 Difference]: Finished difference Result 75788 states and 108040 transitions. [2018-11-23 05:49:53,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:53,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 05:49:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:53,840 INFO L225 Difference]: With dead ends: 75788 [2018-11-23 05:49:53,840 INFO L226 Difference]: Without dead ends: 75786 [2018-11-23 05:49:53,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2018-11-23 05:49:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 65544. [2018-11-23 05:49:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65544 states. [2018-11-23 05:49:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65544 states to 65544 states and 88582 transitions. [2018-11-23 05:49:54,638 INFO L78 Accepts]: Start accepts. Automaton has 65544 states and 88582 transitions. Word has length 35 [2018-11-23 05:49:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:54,638 INFO L480 AbstractCegarLoop]: Abstraction has 65544 states and 88582 transitions. [2018-11-23 05:49:54,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 65544 states and 88582 transitions. [2018-11-23 05:49:54,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 05:49:54,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:54,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:54,673 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:54,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:54,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2038547003, now seen corresponding path program 1 times [2018-11-23 05:49:54,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:54,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:54,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:54,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:54,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:54,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:54,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:54,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:54,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:54,708 INFO L87 Difference]: Start difference. First operand 65544 states and 88582 transitions. Second operand 3 states. [2018-11-23 05:49:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:55,514 INFO L93 Difference]: Finished difference Result 150540 states and 204296 transitions. [2018-11-23 05:49:55,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:55,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 05:49:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:55,572 INFO L225 Difference]: With dead ends: 150540 [2018-11-23 05:49:55,572 INFO L226 Difference]: Without dead ends: 86026 [2018-11-23 05:49:55,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86026 states. [2018-11-23 05:49:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86026 to 86024. [2018-11-23 05:49:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86024 states. [2018-11-23 05:49:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86024 states to 86024 states and 115718 transitions. [2018-11-23 05:49:56,544 INFO L78 Accepts]: Start accepts. Automaton has 86024 states and 115718 transitions. Word has length 35 [2018-11-23 05:49:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:56,544 INFO L480 AbstractCegarLoop]: Abstraction has 86024 states and 115718 transitions. [2018-11-23 05:49:56,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 86024 states and 115718 transitions. [2018-11-23 05:49:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 05:49:56,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:56,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:56,576 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:56,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash 459606565, now seen corresponding path program 1 times [2018-11-23 05:49:56,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:56,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:56,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:56,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:56,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:56,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:56,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:56,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:56,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:56,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:56,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:56,607 INFO L87 Difference]: Start difference. First operand 86024 states and 115718 transitions. Second operand 3 states. [2018-11-23 05:49:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:57,384 INFO L93 Difference]: Finished difference Result 129036 states and 173064 transitions. [2018-11-23 05:49:57,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:57,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 05:49:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:57,443 INFO L225 Difference]: With dead ends: 129036 [2018-11-23 05:49:57,443 INFO L226 Difference]: Without dead ends: 87050 [2018-11-23 05:49:57,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87050 states. [2018-11-23 05:49:58,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87050 to 87048. [2018-11-23 05:49:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87048 states. [2018-11-23 05:49:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87048 states to 87048 states and 115718 transitions. [2018-11-23 05:49:58,452 INFO L78 Accepts]: Start accepts. Automaton has 87048 states and 115718 transitions. Word has length 36 [2018-11-23 05:49:58,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:58,452 INFO L480 AbstractCegarLoop]: Abstraction has 87048 states and 115718 transitions. [2018-11-23 05:49:58,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:49:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 87048 states and 115718 transitions. [2018-11-23 05:49:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 05:49:58,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:58,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:58,478 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:58,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1229337177, now seen corresponding path program 1 times [2018-11-23 05:49:58,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:49:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:58,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:58,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:49:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:58,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:58,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:49:58,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:49:58,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:49:58,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:49:58,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:58,512 INFO L87 Difference]: Start difference. First operand 87048 states and 115718 transitions. Second operand 3 states. [2018-11-23 05:49:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:59,687 INFO L93 Difference]: Finished difference Result 147468 states and 199688 transitions. [2018-11-23 05:49:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:49:59,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 05:49:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:59,800 INFO L225 Difference]: With dead ends: 147468 [2018-11-23 05:49:59,800 INFO L226 Difference]: Without dead ends: 147466 [2018-11-23 05:49:59,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:49:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-11-23 05:50:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 131080. [2018-11-23 05:50:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131080 states. [2018-11-23 05:50:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131080 states to 131080 states and 168966 transitions. [2018-11-23 05:50:01,469 INFO L78 Accepts]: Start accepts. Automaton has 131080 states and 168966 transitions. Word has length 36 [2018-11-23 05:50:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:50:01,470 INFO L480 AbstractCegarLoop]: Abstraction has 131080 states and 168966 transitions. [2018-11-23 05:50:01,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:50:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 131080 states and 168966 transitions. [2018-11-23 05:50:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 05:50:01,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:50:01,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:50:01,524 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:50:01,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:01,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1071485413, now seen corresponding path program 1 times [2018-11-23 05:50:01,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:50:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:01,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:01,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:01,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:50:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:50:01,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:50:01,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:50:01,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:50:01,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:50:01,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:50:01,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:01,560 INFO L87 Difference]: Start difference. First operand 131080 states and 168966 transitions. Second operand 3 states. [2018-11-23 05:50:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:50:03,201 INFO L93 Difference]: Finished difference Result 299020 states and 386056 transitions. [2018-11-23 05:50:03,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:50:03,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 05:50:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:50:03,343 INFO L225 Difference]: With dead ends: 299020 [2018-11-23 05:50:03,343 INFO L226 Difference]: Without dead ends: 169994 [2018-11-23 05:50:03,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169994 states. [2018-11-23 05:50:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169994 to 169992. [2018-11-23 05:50:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169992 states. [2018-11-23 05:50:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169992 states to 169992 states and 217094 transitions. [2018-11-23 05:50:05,677 INFO L78 Accepts]: Start accepts. Automaton has 169992 states and 217094 transitions. Word has length 36 [2018-11-23 05:50:05,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:50:05,677 INFO L480 AbstractCegarLoop]: Abstraction has 169992 states and 217094 transitions. [2018-11-23 05:50:05,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:50:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 169992 states and 217094 transitions. [2018-11-23 05:50:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 05:50:05,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:50:05,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:50:05,737 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:50:05,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash 545468688, now seen corresponding path program 1 times [2018-11-23 05:50:05,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:50:05,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:05,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:05,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:05,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:50:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:50:05,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:50:05,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:50:05,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:50:05,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:50:05,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:50:05,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:05,772 INFO L87 Difference]: Start difference. First operand 169992 states and 217094 transitions. Second operand 3 states. [2018-11-23 05:50:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:50:07,157 INFO L93 Difference]: Finished difference Result 254988 states and 324616 transitions. [2018-11-23 05:50:07,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:50:07,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 05:50:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:50:07,320 INFO L225 Difference]: With dead ends: 254988 [2018-11-23 05:50:07,320 INFO L226 Difference]: Without dead ends: 172042 [2018-11-23 05:50:07,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172042 states. [2018-11-23 05:50:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172042 to 172040. [2018-11-23 05:50:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172040 states. [2018-11-23 05:50:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172040 states to 172040 states and 217094 transitions. [2018-11-23 05:50:09,803 INFO L78 Accepts]: Start accepts. Automaton has 172040 states and 217094 transitions. Word has length 37 [2018-11-23 05:50:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:50:09,803 INFO L480 AbstractCegarLoop]: Abstraction has 172040 states and 217094 transitions. [2018-11-23 05:50:09,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:50:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 172040 states and 217094 transitions. [2018-11-23 05:50:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 05:50:09,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:50:09,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:50:09,863 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:50:09,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:09,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1143475054, now seen corresponding path program 1 times [2018-11-23 05:50:09,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:50:09,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:09,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:09,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:09,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:50:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:50:09,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:50:09,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:50:09,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:50:09,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:50:09,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:50:09,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:09,888 INFO L87 Difference]: Start difference. First operand 172040 states and 217094 transitions. Second operand 3 states. [2018-11-23 05:50:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:50:12,447 INFO L93 Difference]: Finished difference Result 286732 states and 366600 transitions. [2018-11-23 05:50:12,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:50:12,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 05:50:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:50:12,664 INFO L225 Difference]: With dead ends: 286732 [2018-11-23 05:50:12,664 INFO L226 Difference]: Without dead ends: 286730 [2018-11-23 05:50:12,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286730 states. [2018-11-23 05:50:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286730 to 262152. [2018-11-23 05:50:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262152 states. [2018-11-23 05:50:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262152 states to 262152 states and 321542 transitions. [2018-11-23 05:50:18,443 INFO L78 Accepts]: Start accepts. Automaton has 262152 states and 321542 transitions. Word has length 37 [2018-11-23 05:50:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:50:18,443 INFO L480 AbstractCegarLoop]: Abstraction has 262152 states and 321542 transitions. [2018-11-23 05:50:18,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:50:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 262152 states and 321542 transitions. [2018-11-23 05:50:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 05:50:18,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:50:18,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:50:18,555 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:50:18,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:18,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1157347536, now seen corresponding path program 1 times [2018-11-23 05:50:18,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:50:18,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:18,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:18,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:18,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:50:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:50:18,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:50:18,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:50:18,583 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:50:18,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:50:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:50:18,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:18,584 INFO L87 Difference]: Start difference. First operand 262152 states and 321542 transitions. Second operand 3 states. [2018-11-23 05:50:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:50:21,548 INFO L93 Difference]: Finished difference Result 593932 states and 727048 transitions. [2018-11-23 05:50:21,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:50:21,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 05:50:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:50:21,836 INFO L225 Difference]: With dead ends: 593932 [2018-11-23 05:50:21,836 INFO L226 Difference]: Without dead ends: 335882 [2018-11-23 05:50:21,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335882 states. [2018-11-23 05:50:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335882 to 335880. [2018-11-23 05:50:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335880 states. [2018-11-23 05:50:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335880 states to 335880 states and 405510 transitions. [2018-11-23 05:50:27,148 INFO L78 Accepts]: Start accepts. Automaton has 335880 states and 405510 transitions. Word has length 37 [2018-11-23 05:50:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:50:27,148 INFO L480 AbstractCegarLoop]: Abstraction has 335880 states and 405510 transitions. [2018-11-23 05:50:27,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:50:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 335880 states and 405510 transitions. [2018-11-23 05:50:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 05:50:27,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:50:27,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:50:27,272 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:50:27,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1087772454, now seen corresponding path program 1 times [2018-11-23 05:50:27,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:50:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:27,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:27,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:50:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:50:27,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:50:27,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:50:27,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:50:27,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:50:27,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:50:27,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:27,300 INFO L87 Difference]: Start difference. First operand 335880 states and 405510 transitions. Second operand 3 states. [2018-11-23 05:50:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:50:30,232 INFO L93 Difference]: Finished difference Result 503820 states and 606216 transitions. [2018-11-23 05:50:30,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:50:30,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-23 05:50:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:50:30,532 INFO L225 Difference]: With dead ends: 503820 [2018-11-23 05:50:30,532 INFO L226 Difference]: Without dead ends: 339978 [2018-11-23 05:50:30,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339978 states. [2018-11-23 05:50:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339978 to 339976. [2018-11-23 05:50:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339976 states. [2018-11-23 05:50:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339976 states to 339976 states and 405510 transitions. [2018-11-23 05:50:38,045 INFO L78 Accepts]: Start accepts. Automaton has 339976 states and 405510 transitions. Word has length 38 [2018-11-23 05:50:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:50:38,046 INFO L480 AbstractCegarLoop]: Abstraction has 339976 states and 405510 transitions. [2018-11-23 05:50:38,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:50:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 339976 states and 405510 transitions. [2018-11-23 05:50:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 05:50:38,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:50:38,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:50:38,164 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:50:38,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:38,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1518251100, now seen corresponding path program 1 times [2018-11-23 05:50:38,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:50:38,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:38,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:38,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:38,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:50:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:50:38,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:50:38,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:50:38,195 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:50:38,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:50:38,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:50:38,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:38,196 INFO L87 Difference]: Start difference. First operand 339976 states and 405510 transitions. Second operand 3 states. [2018-11-23 05:50:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:50:43,563 INFO L93 Difference]: Finished difference Result 557068 states and 667656 transitions. [2018-11-23 05:50:43,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:50:43,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-23 05:50:43,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:50:44,012 INFO L225 Difference]: With dead ends: 557068 [2018-11-23 05:50:44,012 INFO L226 Difference]: Without dead ends: 557066 [2018-11-23 05:50:44,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557066 states. [2018-11-23 05:50:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557066 to 524296. [2018-11-23 05:50:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524296 states. [2018-11-23 05:50:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524296 states to 524296 states and 610310 transitions. [2018-11-23 05:50:50,399 INFO L78 Accepts]: Start accepts. Automaton has 524296 states and 610310 transitions. Word has length 38 [2018-11-23 05:50:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:50:50,399 INFO L480 AbstractCegarLoop]: Abstraction has 524296 states and 610310 transitions. [2018-11-23 05:50:50,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:50:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 524296 states and 610310 transitions. [2018-11-23 05:50:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 05:50:50,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:50:50,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:50:50,659 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:50:50,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash -475893606, now seen corresponding path program 1 times [2018-11-23 05:50:50,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:50:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:50,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:50,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:50:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:50:50,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:50:50,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:50:50,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:50:50,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:50:50,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:50:50,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:50:50,696 INFO L87 Difference]: Start difference. First operand 524296 states and 610310 transitions. Second operand 3 states. [2018-11-23 05:51:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:51:00,383 INFO L93 Difference]: Finished difference Result 1179660 states and 1363976 transitions. [2018-11-23 05:51:00,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:51:00,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-23 05:51:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:51:00,884 INFO L225 Difference]: With dead ends: 1179660 [2018-11-23 05:51:00,884 INFO L226 Difference]: Without dead ends: 663562 [2018-11-23 05:51:01,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:51:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663562 states. [2018-11-23 05:51:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663562 to 663560. [2018-11-23 05:51:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663560 states. [2018-11-23 05:51:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663560 states to 663560 states and 753670 transitions. [2018-11-23 05:51:10,614 INFO L78 Accepts]: Start accepts. Automaton has 663560 states and 753670 transitions. Word has length 38 [2018-11-23 05:51:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:51:10,614 INFO L480 AbstractCegarLoop]: Abstraction has 663560 states and 753670 transitions. [2018-11-23 05:51:10,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:51:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 663560 states and 753670 transitions. [2018-11-23 05:51:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 05:51:10,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:51:10,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:51:10,866 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:51:10,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:10,867 INFO L82 PathProgramCache]: Analyzing trace with hash -178639963, now seen corresponding path program 1 times [2018-11-23 05:51:10,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:51:10,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:10,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:10,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:10,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:51:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:51:10,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:51:10,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:51:10,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:51:10,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:51:10,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:51:10,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:51:10,892 INFO L87 Difference]: Start difference. First operand 663560 states and 753670 transitions. Second operand 3 states. [2018-11-23 05:51:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:51:21,383 INFO L93 Difference]: Finished difference Result 995340 states and 1126408 transitions. [2018-11-23 05:51:21,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:51:21,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 05:51:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:51:21,924 INFO L225 Difference]: With dead ends: 995340 [2018-11-23 05:51:21,924 INFO L226 Difference]: Without dead ends: 671754 [2018-11-23 05:51:22,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:51:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671754 states. [2018-11-23 05:51:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671754 to 671752. [2018-11-23 05:51:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671752 states. [2018-11-23 05:51:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671752 states to 671752 states and 753670 transitions. [2018-11-23 05:51:31,845 INFO L78 Accepts]: Start accepts. Automaton has 671752 states and 753670 transitions. Word has length 39 [2018-11-23 05:51:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:51:31,846 INFO L480 AbstractCegarLoop]: Abstraction has 671752 states and 753670 transitions. [2018-11-23 05:51:31,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:51:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 671752 states and 753670 transitions. [2018-11-23 05:51:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 05:51:32,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:51:32,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:51:32,101 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:51:32,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:32,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1867583705, now seen corresponding path program 1 times [2018-11-23 05:51:32,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:51:32,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:32,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:32,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:32,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:51:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:51:32,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:51:32,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:51:32,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:51:32,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:51:32,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:51:32,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:51:32,132 INFO L87 Difference]: Start difference. First operand 671752 states and 753670 transitions. Second operand 3 states. [2018-11-23 05:51:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:51:47,539 INFO L93 Difference]: Finished difference Result 1081354 states and 1204231 transitions. [2018-11-23 05:51:47,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:51:47,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 05:51:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:51:48,416 INFO L225 Difference]: With dead ends: 1081354 [2018-11-23 05:51:48,416 INFO L226 Difference]: Without dead ends: 1081352 [2018-11-23 05:51:48,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:51:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081352 states. [2018-11-23 05:52:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081352 to 1048584. [2018-11-23 05:52:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048584 states. [2018-11-23 05:52:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048584 states to 1048584 states and 1155078 transitions. [2018-11-23 05:52:01,276 INFO L78 Accepts]: Start accepts. Automaton has 1048584 states and 1155078 transitions. Word has length 39 [2018-11-23 05:52:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:52:01,276 INFO L480 AbstractCegarLoop]: Abstraction has 1048584 states and 1155078 transitions. [2018-11-23 05:52:01,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:52:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1048584 states and 1155078 transitions. [2018-11-23 05:52:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 05:52:01,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:52:01,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:52:01,759 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:52:01,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:52:01,759 INFO L82 PathProgramCache]: Analyzing trace with hash 433238885, now seen corresponding path program 1 times [2018-11-23 05:52:01,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:52:01,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:52:01,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:52:01,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:52:01,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:52:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:52:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:52:01,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:52:01,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:52:01,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:52:01,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:52:01,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:52:01,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:52:01,794 INFO L87 Difference]: Start difference. First operand 1048584 states and 1155078 transitions. Second operand 3 states. [2018-11-23 05:52:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:52:21,413 INFO L93 Difference]: Finished difference Result 2342920 states and 2547718 transitions. [2018-11-23 05:52:21,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:52:21,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 05:52:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:52:21,414 INFO L225 Difference]: With dead ends: 2342920 [2018-11-23 05:52:21,414 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 05:52:22,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:52:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 05:52:22,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 05:52:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 05:52:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 05:52:22,721 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-11-23 05:52:22,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:52:22,721 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:52:22,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:52:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:52:22,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 05:52:22,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 05:52:22,796 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 05:52:22,796 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-11-23 05:52:22,796 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L451 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L444 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,797 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L451 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-23 05:52:22,798 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 05:52:22,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:52:22 BoogieIcfgContainer [2018-11-23 05:52:22,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:52:22,803 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:52:22,803 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:52:22,803 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:52:22,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:49:45" (3/4) ... [2018-11-23 05:52:22,806 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 05:52:22,811 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 05:52:22,811 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 05:52:22,816 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 05:52:22,816 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 05:52:22,816 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 05:52:22,867 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a04406ae-add1-488c-adbc-431566f7d48c/bin-2019/utaipan/witness.graphml [2018-11-23 05:52:22,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:52:22,868 INFO L168 Benchmark]: Toolchain (without parser) took 158379.76 ms. Allocated memory was 1.0 GB in the beginning and 8.1 GB in the end (delta: 7.1 GB). Free memory was 961.9 MB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-23 05:52:22,869 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:52:22,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.27 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:22,869 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:22,872 INFO L168 Benchmark]: Boogie Preprocessor took 22.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:52:22,872 INFO L168 Benchmark]: RCFGBuilder took 299.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:22,872 INFO L168 Benchmark]: TraceAbstraction took 157749.14 ms. Allocated memory was 1.2 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: -4.0 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-23 05:52:22,873 INFO L168 Benchmark]: Witness Printer took 64.11 ms. Allocated memory is still 8.1 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 396.4 kB). Peak memory consumption was 396.4 kB. Max. memory is 11.5 GB. [2018-11-23 05:52:22,874 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.27 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 299.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 157749.14 ms. Allocated memory was 1.2 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: -4.0 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 64.11 ms. Allocated memory is still 8.1 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 396.4 kB). Peak memory consumption was 396.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: 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: 54]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. SAFE Result, 157.7s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 85.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5309 SDtfs, 2663 SDslu, 3669 SDs, 0 SdLazy, 229 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1048584occurred in iteration=42, 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: 69.0s AutomataMinimizationTime, 43 MinimizatonAttempts, 131120 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 32778 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 89720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...