java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:08:53,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:08:53,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:08:53,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:08:53,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:08:53,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:08:53,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:08:53,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:08:53,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:08:53,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:08:53,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:08:53,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:08:53,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:08:53,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:08:53,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:08:53,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:08:53,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:08:53,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:08:53,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:08:54,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:08:54,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:08:54,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:08:54,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:08:54,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:08:54,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:08:54,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:08:54,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:08:54,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:08:54,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:08:54,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:08:54,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:08:54,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:08:54,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:08:54,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:08:54,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:08:54,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:08:54,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:08:54,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:08:54,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:08:54,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:08:54,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:08:54,024 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:08:54,053 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:08:54,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:08:54,054 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:08:54,054 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:08:54,055 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:08:54,055 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:08:54,055 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:08:54,056 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:08:54,056 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:08:54,056 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:08:54,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:08:54,058 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:08:54,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:08:54,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:08:54,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:08:54,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:08:54,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:08:54,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:08:54,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:08:54,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:08:54,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:08:54,060 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:08:54,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:08:54,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:08:54,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:08:54,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:08:54,062 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:08:54,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:08:54,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:08:54,062 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:08:54,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:08:54,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:08:54,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:08:54,135 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:08:54,135 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:08:54,136 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:08:54,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72d08af4/c79a519f5e60405fbf66f7a0c7028509/FLAG678510793 [2019-09-10 06:08:54,697 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:08:54,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:08:54,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72d08af4/c79a519f5e60405fbf66f7a0c7028509/FLAG678510793 [2019-09-10 06:08:54,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72d08af4/c79a519f5e60405fbf66f7a0c7028509 [2019-09-10 06:08:54,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:08:54,978 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:08:54,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:08:54,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:08:54,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:08:54,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:08:54" (1/1) ... [2019-09-10 06:08:54,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0a4805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:54, skipping insertion in model container [2019-09-10 06:08:54,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:08:54" (1/1) ... [2019-09-10 06:08:54,996 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:08:55,046 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:08:55,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:08:55,444 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:08:55,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:08:55,568 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:08:55,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:55 WrapperNode [2019-09-10 06:08:55,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:08:55,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:08:55,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:08:55,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:08:55,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:55" (1/1) ... [2019-09-10 06:08:55,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:55" (1/1) ... [2019-09-10 06:08:55,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:55" (1/1) ... [2019-09-10 06:08:55,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:55" (1/1) ... [2019-09-10 06:08:55,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:55" (1/1) ... [2019-09-10 06:08:55,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:55" (1/1) ... [2019-09-10 06:08:55,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:55" (1/1) ... [2019-09-10 06:08:55,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:08:55,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:08:55,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:08:55,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:08:55,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-10 06:08:55,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:08:55,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:08:55,685 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:08:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:08:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:08:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:08:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:08:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:08:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:08:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:08:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:08:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:08:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:08:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:08:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:08:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:08:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:08:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:08:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:08:56,482 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:08:56,483 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:08:56,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:08:56 BoogieIcfgContainer [2019-09-10 06:08:56,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:08:56,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:08:56,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:08:56,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:08:56,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:08:54" (1/3) ... [2019-09-10 06:08:56,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1975c8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:08:56, skipping insertion in model container [2019-09-10 06:08:56,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:55" (2/3) ... [2019-09-10 06:08:56,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1975c8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:08:56, skipping insertion in model container [2019-09-10 06:08:56,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:08:56" (3/3) ... [2019-09-10 06:08:56,492 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:08:56,502 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:08:56,510 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:08:56,527 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:08:56,550 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:08:56,550 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:08:56,551 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:08:56,551 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:08:56,551 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:08:56,551 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:08:56,551 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:08:56,552 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:08:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-09-10 06:08:56,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:08:56,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:56,586 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:56,589 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:56,593 INFO L82 PathProgramCache]: Analyzing trace with hash -940649787, now seen corresponding path program 1 times [2019-09-10 06:08:56,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:56,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:56,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:56,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:56,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:57,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:57,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:57,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:57,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:57,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:57,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:57,094 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-09-10 06:08:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:57,206 INFO L93 Difference]: Finished difference Result 213 states and 351 transitions. [2019-09-10 06:08:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:57,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:08:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:57,222 INFO L225 Difference]: With dead ends: 213 [2019-09-10 06:08:57,222 INFO L226 Difference]: Without dead ends: 205 [2019-09-10 06:08:57,224 INFO L628 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 [2019-09-10 06:08:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-10 06:08:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-09-10 06:08:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-10 06:08:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 315 transitions. [2019-09-10 06:08:57,281 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 315 transitions. Word has length 60 [2019-09-10 06:08:57,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:57,282 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 315 transitions. [2019-09-10 06:08:57,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 315 transitions. [2019-09-10 06:08:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:08:57,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:57,286 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:57,286 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash -662873070, now seen corresponding path program 1 times [2019-09-10 06:08:57,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:57,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:57,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:57,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:57,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:57,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:57,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:57,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:57,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:57,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:57,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:57,501 INFO L87 Difference]: Start difference. First operand 202 states and 315 transitions. Second operand 3 states. [2019-09-10 06:08:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:57,563 INFO L93 Difference]: Finished difference Result 332 states and 524 transitions. [2019-09-10 06:08:57,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:57,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-10 06:08:57,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:57,570 INFO L225 Difference]: With dead ends: 332 [2019-09-10 06:08:57,570 INFO L226 Difference]: Without dead ends: 332 [2019-09-10 06:08:57,571 INFO L628 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 [2019-09-10 06:08:57,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-10 06:08:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-09-10 06:08:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-10 06:08:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 521 transitions. [2019-09-10 06:08:57,601 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 521 transitions. Word has length 62 [2019-09-10 06:08:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:57,602 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 521 transitions. [2019-09-10 06:08:57,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 521 transitions. [2019-09-10 06:08:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:08:57,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:57,605 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:57,605 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:57,606 INFO L82 PathProgramCache]: Analyzing trace with hash 443916901, now seen corresponding path program 1 times [2019-09-10 06:08:57,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:57,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:57,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:57,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:57,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:57,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:57,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:57,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:57,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:57,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:57,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:57,726 INFO L87 Difference]: Start difference. First operand 328 states and 521 transitions. Second operand 3 states. [2019-09-10 06:08:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:57,767 INFO L93 Difference]: Finished difference Result 570 states and 906 transitions. [2019-09-10 06:08:57,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:57,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 06:08:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:57,773 INFO L225 Difference]: With dead ends: 570 [2019-09-10 06:08:57,774 INFO L226 Difference]: Without dead ends: 570 [2019-09-10 06:08:57,774 INFO L628 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 [2019-09-10 06:08:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-10 06:08:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 564. [2019-09-10 06:08:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-09-10 06:08:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 901 transitions. [2019-09-10 06:08:57,812 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 901 transitions. Word has length 64 [2019-09-10 06:08:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:57,813 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 901 transitions. [2019-09-10 06:08:57,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 901 transitions. [2019-09-10 06:08:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:08:57,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:57,819 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:57,819 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:57,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:57,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1638426254, now seen corresponding path program 1 times [2019-09-10 06:08:57,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:57,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:57,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:57,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:57,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:58,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:58,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:08:58,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:58,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:08:58,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:08:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:58,018 INFO L87 Difference]: Start difference. First operand 564 states and 901 transitions. Second operand 5 states. [2019-09-10 06:08:58,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:58,190 INFO L93 Difference]: Finished difference Result 1864 states and 3023 transitions. [2019-09-10 06:08:58,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:08:58,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-10 06:08:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:58,201 INFO L225 Difference]: With dead ends: 1864 [2019-09-10 06:08:58,201 INFO L226 Difference]: Without dead ends: 1864 [2019-09-10 06:08:58,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:08:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2019-09-10 06:08:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1450. [2019-09-10 06:08:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2019-09-10 06:08:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2348 transitions. [2019-09-10 06:08:58,257 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2348 transitions. Word has length 66 [2019-09-10 06:08:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:58,257 INFO L475 AbstractCegarLoop]: Abstraction has 1450 states and 2348 transitions. [2019-09-10 06:08:58,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:08:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2348 transitions. [2019-09-10 06:08:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:08:58,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:58,261 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:58,261 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:58,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash 686783218, now seen corresponding path program 1 times [2019-09-10 06:08:58,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:58,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:58,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:58,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:58,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:58,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:58,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:08:58,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:58,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:08:58,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:08:58,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:08:58,371 INFO L87 Difference]: Start difference. First operand 1450 states and 2348 transitions. Second operand 6 states. [2019-09-10 06:08:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:58,577 INFO L93 Difference]: Finished difference Result 5788 states and 9327 transitions. [2019-09-10 06:08:58,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:08:58,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-10 06:08:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:58,606 INFO L225 Difference]: With dead ends: 5788 [2019-09-10 06:08:58,606 INFO L226 Difference]: Without dead ends: 5788 [2019-09-10 06:08:58,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:08:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5788 states. [2019-09-10 06:08:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5689. [2019-09-10 06:08:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5689 states. [2019-09-10 06:08:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 9188 transitions. [2019-09-10 06:08:58,745 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 9188 transitions. Word has length 67 [2019-09-10 06:08:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:58,745 INFO L475 AbstractCegarLoop]: Abstraction has 5689 states and 9188 transitions. [2019-09-10 06:08:58,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:08:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 9188 transitions. [2019-09-10 06:08:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:08:58,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:58,748 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:58,748 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:58,749 INFO L82 PathProgramCache]: Analyzing trace with hash -241609159, now seen corresponding path program 1 times [2019-09-10 06:08:58,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:58,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:58,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:58,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:58,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:58,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:58,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:08:58,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:58,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:08:58,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:08:58,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:58,875 INFO L87 Difference]: Start difference. First operand 5689 states and 9188 transitions. Second operand 4 states. [2019-09-10 06:08:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:59,029 INFO L93 Difference]: Finished difference Result 7870 states and 12714 transitions. [2019-09-10 06:08:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:08:59,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-10 06:08:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:59,080 INFO L225 Difference]: With dead ends: 7870 [2019-09-10 06:08:59,080 INFO L226 Difference]: Without dead ends: 7870 [2019-09-10 06:08:59,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7870 states. [2019-09-10 06:08:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7870 to 7832. [2019-09-10 06:08:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7832 states. [2019-09-10 06:08:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7832 states to 7832 states and 12644 transitions. [2019-09-10 06:08:59,317 INFO L78 Accepts]: Start accepts. Automaton has 7832 states and 12644 transitions. Word has length 68 [2019-09-10 06:08:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:59,317 INFO L475 AbstractCegarLoop]: Abstraction has 7832 states and 12644 transitions. [2019-09-10 06:08:59,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7832 states and 12644 transitions. [2019-09-10 06:08:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:08:59,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:59,324 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:59,325 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:59,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:59,331 INFO L82 PathProgramCache]: Analyzing trace with hash 464144953, now seen corresponding path program 1 times [2019-09-10 06:08:59,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:59,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:59,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:59,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:59,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:59,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:59,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:59,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:59,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:59,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:59,396 INFO L87 Difference]: Start difference. First operand 7832 states and 12644 transitions. Second operand 3 states. [2019-09-10 06:08:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:59,473 INFO L93 Difference]: Finished difference Result 11651 states and 18709 transitions. [2019-09-10 06:08:59,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:59,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:08:59,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:59,542 INFO L225 Difference]: With dead ends: 11651 [2019-09-10 06:08:59,543 INFO L226 Difference]: Without dead ends: 11651 [2019-09-10 06:08:59,543 INFO L628 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 [2019-09-10 06:08:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11651 states. [2019-09-10 06:08:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11651 to 11649. [2019-09-10 06:08:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11649 states. [2019-09-10 06:08:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11649 states to 11649 states and 18708 transitions. [2019-09-10 06:08:59,808 INFO L78 Accepts]: Start accepts. Automaton has 11649 states and 18708 transitions. Word has length 69 [2019-09-10 06:08:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:59,808 INFO L475 AbstractCegarLoop]: Abstraction has 11649 states and 18708 transitions. [2019-09-10 06:08:59,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 11649 states and 18708 transitions. [2019-09-10 06:08:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:08:59,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:59,810 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:59,811 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:59,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:59,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2123298740, now seen corresponding path program 1 times [2019-09-10 06:08:59,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:59,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:59,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:59,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:59,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:59,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:59,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:59,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:59,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:59,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:59,881 INFO L87 Difference]: Start difference. First operand 11649 states and 18708 transitions. Second operand 3 states. [2019-09-10 06:08:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:59,960 INFO L93 Difference]: Finished difference Result 16037 states and 25655 transitions. [2019-09-10 06:08:59,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:59,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:08:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:00,006 INFO L225 Difference]: With dead ends: 16037 [2019-09-10 06:09:00,007 INFO L226 Difference]: Without dead ends: 16037 [2019-09-10 06:09:00,008 INFO L628 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 [2019-09-10 06:09:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16037 states. [2019-09-10 06:09:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16037 to 16035. [2019-09-10 06:09:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16035 states. [2019-09-10 06:09:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16035 states to 16035 states and 25654 transitions. [2019-09-10 06:09:00,436 INFO L78 Accepts]: Start accepts. Automaton has 16035 states and 25654 transitions. Word has length 69 [2019-09-10 06:09:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:00,437 INFO L475 AbstractCegarLoop]: Abstraction has 16035 states and 25654 transitions. [2019-09-10 06:09:00,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 16035 states and 25654 transitions. [2019-09-10 06:09:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:09:00,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:00,439 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:00,439 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:00,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1047556249, now seen corresponding path program 1 times [2019-09-10 06:09:00,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:00,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:00,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:00,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:00,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:09:00,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:00,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:09:00,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:00,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:09:00,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:09:00,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:09:00,513 INFO L87 Difference]: Start difference. First operand 16035 states and 25654 transitions. Second operand 4 states. [2019-09-10 06:09:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:00,682 INFO L93 Difference]: Finished difference Result 33255 states and 53228 transitions. [2019-09-10 06:09:00,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:09:00,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-10 06:09:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:00,753 INFO L225 Difference]: With dead ends: 33255 [2019-09-10 06:09:00,753 INFO L226 Difference]: Without dead ends: 33255 [2019-09-10 06:09:00,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33255 states. [2019-09-10 06:09:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33255 to 24549. [2019-09-10 06:09:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24549 states. [2019-09-10 06:09:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24549 states to 24549 states and 39174 transitions. [2019-09-10 06:09:01,373 INFO L78 Accepts]: Start accepts. Automaton has 24549 states and 39174 transitions. Word has length 69 [2019-09-10 06:09:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:01,373 INFO L475 AbstractCegarLoop]: Abstraction has 24549 states and 39174 transitions. [2019-09-10 06:09:01,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:09:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 24549 states and 39174 transitions. [2019-09-10 06:09:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:09:01,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:01,382 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:01,383 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:01,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:01,383 INFO L82 PathProgramCache]: Analyzing trace with hash 795480594, now seen corresponding path program 1 times [2019-09-10 06:09:01,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:01,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:01,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:01,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:01,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:09:01,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:01,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:09:01,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:01,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:09:01,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:09:01,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:09:01,442 INFO L87 Difference]: Start difference. First operand 24549 states and 39174 transitions. Second operand 3 states. [2019-09-10 06:09:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:02,212 INFO L93 Difference]: Finished difference Result 33790 states and 54047 transitions. [2019-09-10 06:09:02,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:09:02,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:09:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:02,318 INFO L225 Difference]: With dead ends: 33790 [2019-09-10 06:09:02,318 INFO L226 Difference]: Without dead ends: 33790 [2019-09-10 06:09:02,318 INFO L628 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 [2019-09-10 06:09:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33790 states. [2019-09-10 06:09:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33790 to 33788. [2019-09-10 06:09:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33788 states. [2019-09-10 06:09:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33788 states to 33788 states and 54046 transitions. [2019-09-10 06:09:03,013 INFO L78 Accepts]: Start accepts. Automaton has 33788 states and 54046 transitions. Word has length 69 [2019-09-10 06:09:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:03,014 INFO L475 AbstractCegarLoop]: Abstraction has 33788 states and 54046 transitions. [2019-09-10 06:09:03,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 33788 states and 54046 transitions. [2019-09-10 06:09:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:09:03,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:03,016 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:03,016 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash 189572521, now seen corresponding path program 1 times [2019-09-10 06:09:03,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:03,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:03,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:03,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:09:03,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:03,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:09:03,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:03,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:09:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:09:03,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:03,203 INFO L87 Difference]: Start difference. First operand 33788 states and 54046 transitions. Second operand 5 states. [2019-09-10 06:09:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:03,445 INFO L93 Difference]: Finished difference Result 33794 states and 53899 transitions. [2019-09-10 06:09:03,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:09:03,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:09:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:03,551 INFO L225 Difference]: With dead ends: 33794 [2019-09-10 06:09:03,551 INFO L226 Difference]: Without dead ends: 33794 [2019-09-10 06:09:03,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:03,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33794 states. [2019-09-10 06:09:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33794 to 33788. [2019-09-10 06:09:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33788 states. [2019-09-10 06:09:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33788 states to 33788 states and 53896 transitions. [2019-09-10 06:09:04,320 INFO L78 Accepts]: Start accepts. Automaton has 33788 states and 53896 transitions. Word has length 71 [2019-09-10 06:09:04,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:04,320 INFO L475 AbstractCegarLoop]: Abstraction has 33788 states and 53896 transitions. [2019-09-10 06:09:04,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:09:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 33788 states and 53896 transitions. [2019-09-10 06:09:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:09:04,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:04,322 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:04,323 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:04,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1918442634, now seen corresponding path program 1 times [2019-09-10 06:09:04,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:04,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:04,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:04,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:04,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:09:04,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:04,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:09:04,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:04,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:09:04,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:09:04,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:04,500 INFO L87 Difference]: Start difference. First operand 33788 states and 53896 transitions. Second operand 5 states. [2019-09-10 06:09:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:04,813 INFO L93 Difference]: Finished difference Result 59980 states and 95162 transitions. [2019-09-10 06:09:04,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:09:04,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-10 06:09:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:04,944 INFO L225 Difference]: With dead ends: 59980 [2019-09-10 06:09:04,945 INFO L226 Difference]: Without dead ends: 59980 [2019-09-10 06:09:04,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:09:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59980 states. [2019-09-10 06:09:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59980 to 59978. [2019-09-10 06:09:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59978 states. [2019-09-10 06:09:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59978 states to 59978 states and 95161 transitions. [2019-09-10 06:09:06,747 INFO L78 Accepts]: Start accepts. Automaton has 59978 states and 95161 transitions. Word has length 74 [2019-09-10 06:09:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:06,747 INFO L475 AbstractCegarLoop]: Abstraction has 59978 states and 95161 transitions. [2019-09-10 06:09:06,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:09:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 59978 states and 95161 transitions. [2019-09-10 06:09:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:09:06,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:06,750 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:06,750 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash -659729786, now seen corresponding path program 1 times [2019-09-10 06:09:06,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:06,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:06,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:06,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:06,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:09:06,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:06,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:09:06,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:06,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:09:06,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:09:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:06,875 INFO L87 Difference]: Start difference. First operand 59978 states and 95161 transitions. Second operand 5 states. [2019-09-10 06:09:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:07,236 INFO L93 Difference]: Finished difference Result 106051 states and 166558 transitions. [2019-09-10 06:09:07,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:09:07,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 06:09:07,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:07,393 INFO L225 Difference]: With dead ends: 106051 [2019-09-10 06:09:07,393 INFO L226 Difference]: Without dead ends: 106051 [2019-09-10 06:09:07,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:09:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106051 states. [2019-09-10 06:09:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106051 to 61346. [2019-09-10 06:09:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61346 states. [2019-09-10 06:09:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61346 states to 61346 states and 96511 transitions. [2019-09-10 06:09:10,497 INFO L78 Accepts]: Start accepts. Automaton has 61346 states and 96511 transitions. Word has length 75 [2019-09-10 06:09:10,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:10,498 INFO L475 AbstractCegarLoop]: Abstraction has 61346 states and 96511 transitions. [2019-09-10 06:09:10,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:09:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 61346 states and 96511 transitions. [2019-09-10 06:09:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:09:10,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:10,502 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:10,502 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash -242897637, now seen corresponding path program 1 times [2019-09-10 06:09:10,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:10,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:10,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:10,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:10,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:09:10,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:10,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:09:10,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:10,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:09:10,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:09:10,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:09:10,585 INFO L87 Difference]: Start difference. First operand 61346 states and 96511 transitions. Second operand 3 states. [2019-09-10 06:09:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:10,744 INFO L93 Difference]: Finished difference Result 60882 states and 95114 transitions. [2019-09-10 06:09:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:09:10,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:09:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:10,816 INFO L225 Difference]: With dead ends: 60882 [2019-09-10 06:09:10,817 INFO L226 Difference]: Without dead ends: 60882 [2019-09-10 06:09:10,817 INFO L628 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 [2019-09-10 06:09:10,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60882 states. [2019-09-10 06:09:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60882 to 60880. [2019-09-10 06:09:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60880 states. [2019-09-10 06:09:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60880 states to 60880 states and 95113 transitions. [2019-09-10 06:09:11,438 INFO L78 Accepts]: Start accepts. Automaton has 60880 states and 95113 transitions. Word has length 97 [2019-09-10 06:09:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:11,438 INFO L475 AbstractCegarLoop]: Abstraction has 60880 states and 95113 transitions. [2019-09-10 06:09:11,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 60880 states and 95113 transitions. [2019-09-10 06:09:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:09:11,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:11,441 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:11,441 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash 88438004, now seen corresponding path program 1 times [2019-09-10 06:09:11,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:11,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:11,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:11,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:11,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:09:11,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:11,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:09:11,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:11,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:09:11,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:09:11,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:09:11,522 INFO L87 Difference]: Start difference. First operand 60880 states and 95113 transitions. Second operand 3 states. [2019-09-10 06:09:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:11,618 INFO L93 Difference]: Finished difference Result 25351 states and 39365 transitions. [2019-09-10 06:09:11,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:09:11,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:09:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:11,923 INFO L225 Difference]: With dead ends: 25351 [2019-09-10 06:09:11,923 INFO L226 Difference]: Without dead ends: 25351 [2019-09-10 06:09:11,925 INFO L628 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 [2019-09-10 06:09:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25351 states. [2019-09-10 06:09:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25351 to 25349. [2019-09-10 06:09:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25349 states. [2019-09-10 06:09:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25349 states to 25349 states and 39364 transitions. [2019-09-10 06:09:12,298 INFO L78 Accepts]: Start accepts. Automaton has 25349 states and 39364 transitions. Word has length 97 [2019-09-10 06:09:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:12,298 INFO L475 AbstractCegarLoop]: Abstraction has 25349 states and 39364 transitions. [2019-09-10 06:09:12,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 25349 states and 39364 transitions. [2019-09-10 06:09:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:09:12,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:12,301 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:12,301 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:12,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1027309389, now seen corresponding path program 1 times [2019-09-10 06:09:12,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:12,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:12,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:12,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:12,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:09:12,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:12,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:09:12,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:12,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:09:12,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:09:12,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:12,428 INFO L87 Difference]: Start difference. First operand 25349 states and 39364 transitions. Second operand 5 states. [2019-09-10 06:09:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:12,611 INFO L93 Difference]: Finished difference Result 25355 states and 39192 transitions. [2019-09-10 06:09:12,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:09:12,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 06:09:12,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:12,647 INFO L225 Difference]: With dead ends: 25355 [2019-09-10 06:09:12,647 INFO L226 Difference]: Without dead ends: 25355 [2019-09-10 06:09:12,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25355 states. [2019-09-10 06:09:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25355 to 25329. [2019-09-10 06:09:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25329 states. [2019-09-10 06:09:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25329 states to 25329 states and 39169 transitions. [2019-09-10 06:09:12,919 INFO L78 Accepts]: Start accepts. Automaton has 25329 states and 39169 transitions. Word has length 99 [2019-09-10 06:09:12,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:12,920 INFO L475 AbstractCegarLoop]: Abstraction has 25329 states and 39169 transitions. [2019-09-10 06:09:12,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:09:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 25329 states and 39169 transitions. [2019-09-10 06:09:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:09:12,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:12,922 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:12,923 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1219679097, now seen corresponding path program 1 times [2019-09-10 06:09:12,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:12,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:12,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:12,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:12,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:09:13,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:13,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:09:13,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:13,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:09:13,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:09:13,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:13,044 INFO L87 Difference]: Start difference. First operand 25329 states and 39169 transitions. Second operand 5 states. [2019-09-10 06:09:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:13,234 INFO L93 Difference]: Finished difference Result 28759 states and 44376 transitions. [2019-09-10 06:09:13,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:09:13,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 06:09:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:13,284 INFO L225 Difference]: With dead ends: 28759 [2019-09-10 06:09:13,284 INFO L226 Difference]: Without dead ends: 28759 [2019-09-10 06:09:13,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28759 states. [2019-09-10 06:09:13,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28759 to 28693. [2019-09-10 06:09:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28693 states. [2019-09-10 06:09:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28693 states to 28693 states and 44313 transitions. [2019-09-10 06:09:13,854 INFO L78 Accepts]: Start accepts. Automaton has 28693 states and 44313 transitions. Word has length 99 [2019-09-10 06:09:13,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:13,854 INFO L475 AbstractCegarLoop]: Abstraction has 28693 states and 44313 transitions. [2019-09-10 06:09:13,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:09:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 28693 states and 44313 transitions. [2019-09-10 06:09:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:09:13,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:13,857 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:13,857 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:13,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:13,857 INFO L82 PathProgramCache]: Analyzing trace with hash 636454422, now seen corresponding path program 1 times [2019-09-10 06:09:13,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:13,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:13,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:13,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:13,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:09:13,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:13,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:09:13,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:13,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:09:13,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:09:13,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:09:13,931 INFO L87 Difference]: Start difference. First operand 28693 states and 44313 transitions. Second operand 3 states. [2019-09-10 06:09:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:14,111 INFO L93 Difference]: Finished difference Result 51351 states and 79261 transitions. [2019-09-10 06:09:14,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:09:14,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 06:09:14,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:14,199 INFO L225 Difference]: With dead ends: 51351 [2019-09-10 06:09:14,199 INFO L226 Difference]: Without dead ends: 51351 [2019-09-10 06:09:14,200 INFO L628 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 [2019-09-10 06:09:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51351 states. [2019-09-10 06:09:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51351 to 51296. [2019-09-10 06:09:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51296 states. [2019-09-10 06:09:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51296 states to 51296 states and 79207 transitions. [2019-09-10 06:09:14,775 INFO L78 Accepts]: Start accepts. Automaton has 51296 states and 79207 transitions. Word has length 100 [2019-09-10 06:09:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:14,776 INFO L475 AbstractCegarLoop]: Abstraction has 51296 states and 79207 transitions. [2019-09-10 06:09:14,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 51296 states and 79207 transitions. [2019-09-10 06:09:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:09:14,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:14,779 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:14,779 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:14,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2066507146, now seen corresponding path program 1 times [2019-09-10 06:09:14,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:14,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:14,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:09:14,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:14,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:09:14,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:14,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:09:14,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:09:14,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:09:14,870 INFO L87 Difference]: Start difference. First operand 51296 states and 79207 transitions. Second operand 3 states. [2019-09-10 06:09:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:14,937 INFO L93 Difference]: Finished difference Result 21671 states and 33265 transitions. [2019-09-10 06:09:14,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:09:14,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 06:09:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:14,964 INFO L225 Difference]: With dead ends: 21671 [2019-09-10 06:09:14,964 INFO L226 Difference]: Without dead ends: 21671 [2019-09-10 06:09:14,965 INFO L628 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 [2019-09-10 06:09:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21671 states. [2019-09-10 06:09:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21671 to 21669. [2019-09-10 06:09:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21669 states. [2019-09-10 06:09:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21669 states to 21669 states and 33264 transitions. [2019-09-10 06:09:15,312 INFO L78 Accepts]: Start accepts. Automaton has 21669 states and 33264 transitions. Word has length 100 [2019-09-10 06:09:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:15,313 INFO L475 AbstractCegarLoop]: Abstraction has 21669 states and 33264 transitions. [2019-09-10 06:09:15,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 21669 states and 33264 transitions. [2019-09-10 06:09:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:09:15,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:15,317 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:15,318 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1160085683, now seen corresponding path program 1 times [2019-09-10 06:09:15,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:15,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:15,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:15,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:09:15,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:09:15,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:09:15,778 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 06:09:15,781 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [145], [149], [154], [171], [174], [176], [180], [185], [207], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [280], [284], [288], [292], [294], [296], [299], [324], [332], [340], [350], [354], [356], [358], [361], [386], [394], [402], [408], [412], [416], [418], [420], [423], [448], [456], [464], [575], [576], [580], [581], [582] [2019-09-10 06:09:15,838 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:09:15,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:09:16,065 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:09:16,543 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:09:16,546 INFO L272 AbstractInterpreter]: Visited 99 different actions 405 times. Merged at 53 different actions 281 times. Widened at 18 different actions 36 times. Performed 1196 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 159 variables. [2019-09-10 06:09:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:16,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:09:16,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:09:16,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:09:16,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:16,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:09:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:16,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:09:16,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:09:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:09:16,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:09:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:09:16,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 06:09:16,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 06:09:16,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:16,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:09:16,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:09:16,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:09:16,965 INFO L87 Difference]: Start difference. First operand 21669 states and 33264 transitions. Second operand 5 states. [2019-09-10 06:09:17,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:17,145 INFO L93 Difference]: Finished difference Result 23062 states and 35391 transitions. [2019-09-10 06:09:17,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:09:17,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 06:09:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:17,248 INFO L225 Difference]: With dead ends: 23062 [2019-09-10 06:09:17,248 INFO L226 Difference]: Without dead ends: 23062 [2019-09-10 06:09:17,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:09:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23062 states. [2019-09-10 06:09:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23062 to 23035. [2019-09-10 06:09:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23035 states. [2019-09-10 06:09:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23035 states to 23035 states and 35367 transitions. [2019-09-10 06:09:17,797 INFO L78 Accepts]: Start accepts. Automaton has 23035 states and 35367 transitions. Word has length 101 [2019-09-10 06:09:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:17,797 INFO L475 AbstractCegarLoop]: Abstraction has 23035 states and 35367 transitions. [2019-09-10 06:09:17,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:09:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 23035 states and 35367 transitions. [2019-09-10 06:09:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:09:17,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:17,801 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:17,801 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:17,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:17,801 INFO L82 PathProgramCache]: Analyzing trace with hash -381064316, now seen corresponding path program 1 times [2019-09-10 06:09:17,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:17,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:17,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:09:18,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:18,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:09:18,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:18,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:09:18,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:09:18,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:09:18,075 INFO L87 Difference]: Start difference. First operand 23035 states and 35367 transitions. Second operand 4 states. [2019-09-10 06:09:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:18,262 INFO L93 Difference]: Finished difference Result 45194 states and 68975 transitions. [2019-09-10 06:09:18,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:09:18,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-10 06:09:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:18,480 INFO L225 Difference]: With dead ends: 45194 [2019-09-10 06:09:18,480 INFO L226 Difference]: Without dead ends: 45194 [2019-09-10 06:09:18,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45194 states. [2019-09-10 06:09:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45194 to 45192. [2019-09-10 06:09:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45192 states. [2019-09-10 06:09:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45192 states to 45192 states and 68974 transitions. [2019-09-10 06:09:19,701 INFO L78 Accepts]: Start accepts. Automaton has 45192 states and 68974 transitions. Word has length 102 [2019-09-10 06:09:19,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:19,701 INFO L475 AbstractCegarLoop]: Abstraction has 45192 states and 68974 transitions. [2019-09-10 06:09:19,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:09:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 45192 states and 68974 transitions. [2019-09-10 06:09:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:09:19,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:19,705 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:19,705 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:19,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:19,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1735669958, now seen corresponding path program 1 times [2019-09-10 06:09:19,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:19,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:19,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:19,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:19,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:09:19,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:19,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:09:19,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:19,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:09:19,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:09:19,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:09:19,799 INFO L87 Difference]: Start difference. First operand 45192 states and 68974 transitions. Second operand 3 states. [2019-09-10 06:09:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:20,030 INFO L93 Difference]: Finished difference Result 90370 states and 137927 transitions. [2019-09-10 06:09:20,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:09:20,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 06:09:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:20,287 INFO L225 Difference]: With dead ends: 90370 [2019-09-10 06:09:20,288 INFO L226 Difference]: Without dead ends: 90370 [2019-09-10 06:09:20,290 INFO L628 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 [2019-09-10 06:09:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90370 states. [2019-09-10 06:09:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90370 to 45194. [2019-09-10 06:09:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45194 states. [2019-09-10 06:09:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45194 states to 45194 states and 68976 transitions. [2019-09-10 06:09:21,264 INFO L78 Accepts]: Start accepts. Automaton has 45194 states and 68976 transitions. Word has length 103 [2019-09-10 06:09:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:21,264 INFO L475 AbstractCegarLoop]: Abstraction has 45194 states and 68976 transitions. [2019-09-10 06:09:21,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 45194 states and 68976 transitions. [2019-09-10 06:09:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:09:21,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:21,267 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:21,268 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:21,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:21,268 INFO L82 PathProgramCache]: Analyzing trace with hash -854773197, now seen corresponding path program 1 times [2019-09-10 06:09:21,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:21,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:21,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:21,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:21,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:09:21,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:21,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:09:21,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:21,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:09:21,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:09:21,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:09:21,347 INFO L87 Difference]: Start difference. First operand 45194 states and 68976 transitions. Second operand 3 states. [2019-09-10 06:09:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:21,657 INFO L93 Difference]: Finished difference Result 87282 states and 132068 transitions. [2019-09-10 06:09:21,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:09:21,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 06:09:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:21,831 INFO L225 Difference]: With dead ends: 87282 [2019-09-10 06:09:21,831 INFO L226 Difference]: Without dead ends: 87282 [2019-09-10 06:09:21,832 INFO L628 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 [2019-09-10 06:09:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87282 states. [2019-09-10 06:09:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87282 to 87280. [2019-09-10 06:09:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87280 states. [2019-09-10 06:09:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87280 states to 87280 states and 132067 transitions. [2019-09-10 06:09:23,403 INFO L78 Accepts]: Start accepts. Automaton has 87280 states and 132067 transitions. Word has length 104 [2019-09-10 06:09:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:23,404 INFO L475 AbstractCegarLoop]: Abstraction has 87280 states and 132067 transitions. [2019-09-10 06:09:23,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 87280 states and 132067 transitions. [2019-09-10 06:09:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:09:23,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:23,409 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:23,409 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1855097296, now seen corresponding path program 1 times [2019-09-10 06:09:23,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:23,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:23,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:23,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:09:23,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:23,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:09:23,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:23,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:09:23,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:09:23,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:09:23,522 INFO L87 Difference]: Start difference. First operand 87280 states and 132067 transitions. Second operand 4 states. [2019-09-10 06:09:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:23,733 INFO L93 Difference]: Finished difference Result 66727 states and 100597 transitions. [2019-09-10 06:09:23,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:09:23,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 06:09:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:23,824 INFO L225 Difference]: With dead ends: 66727 [2019-09-10 06:09:23,824 INFO L226 Difference]: Without dead ends: 66667 [2019-09-10 06:09:23,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66667 states. [2019-09-10 06:09:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66667 to 66667. [2019-09-10 06:09:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66667 states. [2019-09-10 06:09:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66667 states to 66667 states and 100511 transitions. [2019-09-10 06:09:25,084 INFO L78 Accepts]: Start accepts. Automaton has 66667 states and 100511 transitions. Word has length 104 [2019-09-10 06:09:25,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:25,084 INFO L475 AbstractCegarLoop]: Abstraction has 66667 states and 100511 transitions. [2019-09-10 06:09:25,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:09:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 66667 states and 100511 transitions. [2019-09-10 06:09:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:09:25,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:25,089 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:25,089 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash -836909356, now seen corresponding path program 1 times [2019-09-10 06:09:25,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:25,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:25,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:25,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:25,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:09:25,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:09:25,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:09:25,310 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 06:09:25,311 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [145], [149], [154], [157], [160], [171], [174], [176], [180], [185], [202], [205], [207], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [280], [288], [292], [294], [296], [299], [324], [332], [340], [350], [356], [358], [361], [386], [394], [402], [408], [412], [416], [418], [420], [423], [426], [429], [432], [434], [448], [456], [575], [576], [580], [581], [582] [2019-09-10 06:09:25,322 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:09:25,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:09:25,374 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:09:25,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:09:25,731 INFO L272 AbstractInterpreter]: Visited 104 different actions 493 times. Merged at 58 different actions 356 times. Widened at 23 different actions 60 times. Performed 1466 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1466 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 13 different actions. Largest state had 160 variables. [2019-09-10 06:09:25,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:25,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:09:25,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:09:25,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:09:25,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:25,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:09:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:25,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:09:25,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:09:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:09:25,950 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:09:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:09:25,984 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:09:25,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2019-09-10 06:09:25,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:25,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:09:25,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:09:25,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:09:25,985 INFO L87 Difference]: Start difference. First operand 66667 states and 100511 transitions. Second operand 4 states. [2019-09-10 06:09:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:26,368 INFO L93 Difference]: Finished difference Result 107542 states and 161862 transitions. [2019-09-10 06:09:26,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:09:26,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 06:09:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:26,569 INFO L225 Difference]: With dead ends: 107542 [2019-09-10 06:09:26,569 INFO L226 Difference]: Without dead ends: 107542 [2019-09-10 06:09:26,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:09:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107542 states. [2019-09-10 06:09:27,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107542 to 105384. [2019-09-10 06:09:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105384 states. [2019-09-10 06:09:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105384 states to 105384 states and 158691 transitions. [2019-09-10 06:09:30,488 INFO L78 Accepts]: Start accepts. Automaton has 105384 states and 158691 transitions. Word has length 106 [2019-09-10 06:09:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:30,488 INFO L475 AbstractCegarLoop]: Abstraction has 105384 states and 158691 transitions. [2019-09-10 06:09:30,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:09:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 105384 states and 158691 transitions. [2019-09-10 06:09:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:09:30,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:30,492 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:30,492 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash 998727188, now seen corresponding path program 1 times [2019-09-10 06:09:30,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:30,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:30,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:30,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:30,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:09:30,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:30,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:09:30,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:30,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:09:30,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:09:30,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:09:30,631 INFO L87 Difference]: Start difference. First operand 105384 states and 158691 transitions. Second operand 4 states. [2019-09-10 06:09:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:31,098 INFO L93 Difference]: Finished difference Result 172905 states and 258402 transitions. [2019-09-10 06:09:31,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:09:31,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 06:09:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:31,394 INFO L225 Difference]: With dead ends: 172905 [2019-09-10 06:09:31,394 INFO L226 Difference]: Without dead ends: 172905 [2019-09-10 06:09:31,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172905 states. [2019-09-10 06:09:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172905 to 172903. [2019-09-10 06:09:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172903 states. [2019-09-10 06:09:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172903 states to 172903 states and 258401 transitions. [2019-09-10 06:09:33,621 INFO L78 Accepts]: Start accepts. Automaton has 172903 states and 258401 transitions. Word has length 106 [2019-09-10 06:09:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:33,621 INFO L475 AbstractCegarLoop]: Abstraction has 172903 states and 258401 transitions. [2019-09-10 06:09:33,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:09:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 172903 states and 258401 transitions. [2019-09-10 06:09:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:09:33,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:33,627 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:33,627 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:33,627 INFO L82 PathProgramCache]: Analyzing trace with hash -229277515, now seen corresponding path program 1 times [2019-09-10 06:09:33,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:33,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:33,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:33,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:33,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:09:33,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:33,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:09:33,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:33,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:09:33,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:09:33,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:09:33,699 INFO L87 Difference]: Start difference. First operand 172903 states and 258401 transitions. Second operand 3 states. [2019-09-10 06:09:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:34,633 INFO L93 Difference]: Finished difference Result 333445 states and 493477 transitions. [2019-09-10 06:09:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:09:34,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 06:09:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:35,176 INFO L225 Difference]: With dead ends: 333445 [2019-09-10 06:09:35,176 INFO L226 Difference]: Without dead ends: 333445 [2019-09-10 06:09:35,177 INFO L628 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 [2019-09-10 06:09:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333445 states. [2019-09-10 06:09:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333445 to 333443. [2019-09-10 06:09:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333443 states. [2019-09-10 06:09:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333443 states to 333443 states and 493476 transitions. [2019-09-10 06:09:42,980 INFO L78 Accepts]: Start accepts. Automaton has 333443 states and 493476 transitions. Word has length 108 [2019-09-10 06:09:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:42,980 INFO L475 AbstractCegarLoop]: Abstraction has 333443 states and 493476 transitions. [2019-09-10 06:09:42,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 333443 states and 493476 transitions. [2019-09-10 06:09:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:09:42,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:42,987 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:42,987 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:42,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1206084882, now seen corresponding path program 1 times [2019-09-10 06:09:42,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:42,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:42,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:42,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:42,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:09:43,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:43,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:09:43,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:43,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:09:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:09:43,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:09:43,082 INFO L87 Difference]: Start difference. First operand 333443 states and 493476 transitions. Second operand 4 states. [2019-09-10 06:09:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:43,729 INFO L93 Difference]: Finished difference Result 270842 states and 399749 transitions. [2019-09-10 06:09:43,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:09:43,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-10 06:09:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:44,077 INFO L225 Difference]: With dead ends: 270842 [2019-09-10 06:09:44,078 INFO L226 Difference]: Without dead ends: 270794 [2019-09-10 06:09:44,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270794 states. [2019-09-10 06:09:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270794 to 270794. [2019-09-10 06:09:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270794 states. [2019-09-10 06:09:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270794 states to 270794 states and 399686 transitions. [2019-09-10 06:09:53,032 INFO L78 Accepts]: Start accepts. Automaton has 270794 states and 399686 transitions. Word has length 108 [2019-09-10 06:09:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:53,032 INFO L475 AbstractCegarLoop]: Abstraction has 270794 states and 399686 transitions. [2019-09-10 06:09:53,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:09:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 270794 states and 399686 transitions. [2019-09-10 06:09:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:09:53,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:53,038 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:53,039 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:53,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:53,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2089837102, now seen corresponding path program 1 times [2019-09-10 06:09:53,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:53,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:53,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:53,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:53,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:09:53,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:53,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:09:53,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:53,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:09:53,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:09:53,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:09:53,087 INFO L87 Difference]: Start difference. First operand 270794 states and 399686 transitions. Second operand 3 states. [2019-09-10 06:09:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:54,213 INFO L93 Difference]: Finished difference Result 537679 states and 788803 transitions. [2019-09-10 06:09:54,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:09:54,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 06:09:54,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:55,146 INFO L225 Difference]: With dead ends: 537679 [2019-09-10 06:09:55,146 INFO L226 Difference]: Without dead ends: 537679 [2019-09-10 06:09:55,146 INFO L628 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 [2019-09-10 06:09:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537679 states. [2019-09-10 06:10:06,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537679 to 537677. [2019-09-10 06:10:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537677 states. [2019-09-10 06:10:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537677 states to 537677 states and 788802 transitions. [2019-09-10 06:10:08,344 INFO L78 Accepts]: Start accepts. Automaton has 537677 states and 788802 transitions. Word has length 110 [2019-09-10 06:10:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:08,345 INFO L475 AbstractCegarLoop]: Abstraction has 537677 states and 788802 transitions. [2019-09-10 06:10:08,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 537677 states and 788802 transitions. [2019-09-10 06:10:08,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:10:08,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:08,354 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:08,354 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:08,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:08,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1973856727, now seen corresponding path program 1 times [2019-09-10 06:10:08,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:08,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:08,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:08,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:08,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:10:08,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:08,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:08,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:08,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:08,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:08,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:08,470 INFO L87 Difference]: Start difference. First operand 537677 states and 788802 transitions. Second operand 4 states. [2019-09-10 06:10:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:18,011 INFO L93 Difference]: Finished difference Result 1036324 states and 1503910 transitions. [2019-09-10 06:10:18,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:18,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-10 06:10:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:20,619 INFO L225 Difference]: With dead ends: 1036324 [2019-09-10 06:10:20,620 INFO L226 Difference]: Without dead ends: 1036324 [2019-09-10 06:10:20,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036324 states. [2019-09-10 06:10:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036324 to 1036322. [2019-09-10 06:10:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036322 states. [2019-09-10 06:11:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036322 states to 1036322 states and 1503909 transitions. [2019-09-10 06:11:05,818 INFO L78 Accepts]: Start accepts. Automaton has 1036322 states and 1503909 transitions. Word has length 110 [2019-09-10 06:11:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:05,819 INFO L475 AbstractCegarLoop]: Abstraction has 1036322 states and 1503909 transitions. [2019-09-10 06:11:05,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1036322 states and 1503909 transitions. [2019-09-10 06:11:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:11:05,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:05,836 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:05,837 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash 325039021, now seen corresponding path program 1 times [2019-09-10 06:11:05,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:05,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:05,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:11:05,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:05,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:05,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:05,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:05,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:05,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:05,878 INFO L87 Difference]: Start difference. First operand 1036322 states and 1503909 transitions. Second operand 3 states. [2019-09-10 06:11:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:24,253 INFO L93 Difference]: Finished difference Result 2072554 states and 3007701 transitions. [2019-09-10 06:11:24,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:24,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 06:11:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:28,831 INFO L225 Difference]: With dead ends: 2072554 [2019-09-10 06:11:28,831 INFO L226 Difference]: Without dead ends: 2072554 [2019-09-10 06:11:28,832 INFO L628 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 [2019-09-10 06:11:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072554 states. [2019-09-10 06:12:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072554 to 1036328. [2019-09-10 06:12:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036328 states. [2019-09-10 06:12:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036328 states to 1036328 states and 1503915 transitions. [2019-09-10 06:12:18,771 INFO L78 Accepts]: Start accepts. Automaton has 1036328 states and 1503915 transitions. Word has length 111 [2019-09-10 06:12:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:18,771 INFO L475 AbstractCegarLoop]: Abstraction has 1036328 states and 1503915 transitions. [2019-09-10 06:12:18,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1036328 states and 1503915 transitions. [2019-09-10 06:12:18,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:12:18,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:18,796 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:18,796 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:18,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash -585328086, now seen corresponding path program 1 times [2019-09-10 06:12:18,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:18,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:18,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:18,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:18,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:12:18,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:18,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:18,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:18,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:18,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:18,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:18,932 INFO L87 Difference]: Start difference. First operand 1036328 states and 1503915 transitions. Second operand 4 states. [2019-09-10 06:12:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:35,609 INFO L93 Difference]: Finished difference Result 1036513 states and 1504131 transitions. [2019-09-10 06:12:35,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:35,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 06:12:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:37,425 INFO L225 Difference]: With dead ends: 1036513 [2019-09-10 06:12:37,425 INFO L226 Difference]: Without dead ends: 1036322 [2019-09-10 06:12:37,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036322 states. [2019-09-10 06:13:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036322 to 1036322. [2019-09-10 06:13:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036322 states. [2019-09-10 06:13:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036322 states to 1036322 states and 1503903 transitions. [2019-09-10 06:13:08,362 INFO L78 Accepts]: Start accepts. Automaton has 1036322 states and 1503903 transitions. Word has length 112 [2019-09-10 06:13:08,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:08,362 INFO L475 AbstractCegarLoop]: Abstraction has 1036322 states and 1503903 transitions. [2019-09-10 06:13:08,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1036322 states and 1503903 transitions. [2019-09-10 06:13:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:13:08,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:08,377 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:08,378 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:08,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:08,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1224543300, now seen corresponding path program 1 times [2019-09-10 06:13:08,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:08,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:08,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:08,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:08,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:13:08,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:08,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:08,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:08,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:08,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:08,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:08,440 INFO L87 Difference]: Start difference. First operand 1036322 states and 1503903 transitions. Second operand 3 states. [2019-09-10 06:13:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:22,228 INFO L93 Difference]: Finished difference Result 1535003 states and 2193062 transitions. [2019-09-10 06:13:22,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:22,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 06:13:22,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:24,851 INFO L225 Difference]: With dead ends: 1535003 [2019-09-10 06:13:24,852 INFO L226 Difference]: Without dead ends: 1535003 [2019-09-10 06:13:24,852 INFO L628 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 [2019-09-10 06:13:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535003 states. [2019-09-10 06:14:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535003 to 1535001. [2019-09-10 06:14:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535001 states. [2019-09-10 06:14:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535001 states to 1535001 states and 2193061 transitions. [2019-09-10 06:14:17,556 INFO L78 Accepts]: Start accepts. Automaton has 1535001 states and 2193061 transitions. Word has length 112 [2019-09-10 06:14:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:17,556 INFO L475 AbstractCegarLoop]: Abstraction has 1535001 states and 2193061 transitions. [2019-09-10 06:14:17,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1535001 states and 2193061 transitions. [2019-09-10 06:14:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:14:17,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:17,574 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:17,575 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:17,575 INFO L82 PathProgramCache]: Analyzing trace with hash -686184826, now seen corresponding path program 1 times [2019-09-10 06:14:17,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:17,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:17,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:14:17,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:17,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:14:17,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:17,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:14:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:14:17,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:14:17,659 INFO L87 Difference]: Start difference. First operand 1535001 states and 2193061 transitions. Second operand 5 states. [2019-09-10 06:14:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:32,496 INFO L93 Difference]: Finished difference Result 1535001 states and 2159537 transitions. [2019-09-10 06:14:32,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:14:32,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-10 06:14:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:36,368 INFO L225 Difference]: With dead ends: 1535001 [2019-09-10 06:14:36,368 INFO L226 Difference]: Without dead ends: 1535001 [2019-09-10 06:14:36,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:14:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535001 states.