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_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:50:31,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:50:31,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:50:31,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:50:31,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:50:31,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:50:31,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:50:31,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:50:31,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:50:31,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:50:31,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:50:31,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:50:31,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:50:31,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:50:31,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:50:31,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:50:31,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:50:31,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:50:31,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:50:31,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:50:31,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:50:31,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:50:31,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:50:31,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:50:31,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:50:31,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:50:31,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:50:31,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:50:31,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:50:31,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:50:31,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:50:31,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:50:31,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:50:31,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:50:31,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:50:31,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:50:31,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:50:31,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:50:31,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:50:31,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:50:31,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:50:31,781 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:50:31,795 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:50:31,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:50:31,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:50:31,796 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:50:31,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:50:31,797 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:50:31,797 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:50:31,797 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:50:31,798 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:50:31,798 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:50:31,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:50:31,799 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:50:31,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:50:31,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:50:31,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:50:31,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:50:31,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:50:31,800 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:50:31,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:50:31,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:50:31,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:50:31,801 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:50:31,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:50:31,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:50:31,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:50:31,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:50:31,802 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:50:31,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:50:31,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:50:31,802 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:50:31,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:50:31,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:50:31,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:50:31,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:50:31,855 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:50:31,856 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:50:31,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c302d19d/c90d7f96f06a42cc847a3f636e636d52/FLAG271e4e267 [2019-09-10 06:50:32,333 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:50:32,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:50:32,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c302d19d/c90d7f96f06a42cc847a3f636e636d52/FLAG271e4e267 [2019-09-10 06:50:32,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c302d19d/c90d7f96f06a42cc847a3f636e636d52 [2019-09-10 06:50:32,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:50:32,700 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:50:32,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:50:32,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:50:32,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:50:32,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:50:32" (1/1) ... [2019-09-10 06:50:32,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fe896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:32, skipping insertion in model container [2019-09-10 06:50:32,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:50:32" (1/1) ... [2019-09-10 06:50:32,718 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:50:32,767 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:50:33,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:50:33,033 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:50:33,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:50:33,248 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:50:33,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:33 WrapperNode [2019-09-10 06:50:33,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:50:33,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:50:33,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:50:33,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:50:33,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:33" (1/1) ... [2019-09-10 06:50:33,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:33" (1/1) ... [2019-09-10 06:50:33,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:33" (1/1) ... [2019-09-10 06:50:33,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:33" (1/1) ... [2019-09-10 06:50:33,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:33" (1/1) ... [2019-09-10 06:50:33,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:33" (1/1) ... [2019-09-10 06:50:33,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:33" (1/1) ... [2019-09-10 06:50:33,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:50:33,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:50:33,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:50:33,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:50:33,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:33" (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:50:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:50:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:50:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:50:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:50:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:50:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:50:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:50:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:50:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:50:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:50:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:50:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:50:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:50:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:50:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:50:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:50:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:50:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:50:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:50:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:50:34,072 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:50:34,073 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:50:34,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:50:34 BoogieIcfgContainer [2019-09-10 06:50:34,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:50:34,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:50:34,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:50:34,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:50:34,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:50:32" (1/3) ... [2019-09-10 06:50:34,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708533e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:50:34, skipping insertion in model container [2019-09-10 06:50:34,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:33" (2/3) ... [2019-09-10 06:50:34,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708533e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:50:34, skipping insertion in model container [2019-09-10 06:50:34,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:50:34" (3/3) ... [2019-09-10 06:50:34,090 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:50:34,100 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:50:34,111 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:50:34,130 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:50:34,159 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:50:34,159 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:50:34,159 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:50:34,159 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:50:34,160 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:50:34,160 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:50:34,160 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:50:34,160 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:50:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-09-10 06:50:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 06:50:34,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:34,201 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] [2019-09-10 06:50:34,203 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:34,208 INFO L82 PathProgramCache]: Analyzing trace with hash 66205719, now seen corresponding path program 1 times [2019-09-10 06:50:34,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:34,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:34,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:34,665 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:50:34,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:34,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:34,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:34,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:34,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:34,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:34,692 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2019-09-10 06:50:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:34,771 INFO L93 Difference]: Finished difference Result 187 states and 295 transitions. [2019-09-10 06:50:34,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:34,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-10 06:50:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:34,793 INFO L225 Difference]: With dead ends: 187 [2019-09-10 06:50:34,794 INFO L226 Difference]: Without dead ends: 179 [2019-09-10 06:50:34,796 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:50:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-10 06:50:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-09-10 06:50:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-10 06:50:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2019-09-10 06:50:34,859 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 53 [2019-09-10 06:50:34,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:34,860 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2019-09-10 06:50:34,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:34,860 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2019-09-10 06:50:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 06:50:34,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:34,863 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] [2019-09-10 06:50:34,863 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash -160431346, now seen corresponding path program 1 times [2019-09-10 06:50:34,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:34,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:34,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:34,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:34,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:35,002 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:50:35,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:35,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:35,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:35,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:35,008 INFO L87 Difference]: Start difference. First operand 177 states and 263 transitions. Second operand 3 states. [2019-09-10 06:50:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:35,059 INFO L93 Difference]: Finished difference Result 291 states and 441 transitions. [2019-09-10 06:50:35,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:35,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-10 06:50:35,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:35,064 INFO L225 Difference]: With dead ends: 291 [2019-09-10 06:50:35,064 INFO L226 Difference]: Without dead ends: 291 [2019-09-10 06:50:35,065 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:50:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-10 06:50:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-09-10 06:50:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-10 06:50:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 440 transitions. [2019-09-10 06:50:35,088 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 440 transitions. Word has length 54 [2019-09-10 06:50:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:35,089 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 440 transitions. [2019-09-10 06:50:35,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 440 transitions. [2019-09-10 06:50:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:50:35,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:35,092 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] [2019-09-10 06:50:35,092 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:35,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash 783075062, now seen corresponding path program 1 times [2019-09-10 06:50:35,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:35,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:35,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:35,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:35,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:35,237 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:50:35,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:35,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:35,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:35,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:35,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:35,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:35,239 INFO L87 Difference]: Start difference. First operand 289 states and 440 transitions. Second operand 3 states. [2019-09-10 06:50:35,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:35,282 INFO L93 Difference]: Finished difference Result 483 states and 741 transitions. [2019-09-10 06:50:35,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:35,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-10 06:50:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:35,290 INFO L225 Difference]: With dead ends: 483 [2019-09-10 06:50:35,290 INFO L226 Difference]: Without dead ends: 483 [2019-09-10 06:50:35,292 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:50:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-10 06:50:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2019-09-10 06:50:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-10 06:50:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 740 transitions. [2019-09-10 06:50:35,327 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 740 transitions. Word has length 55 [2019-09-10 06:50:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:35,327 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 740 transitions. [2019-09-10 06:50:35,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 740 transitions. [2019-09-10 06:50:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:50:35,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:35,330 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] [2019-09-10 06:50:35,330 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:35,331 INFO L82 PathProgramCache]: Analyzing trace with hash -842625673, now seen corresponding path program 1 times [2019-09-10 06:50:35,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:35,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:35,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:35,459 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:50:35,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:35,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:50:35,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:35,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:50:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:50:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:50:35,461 INFO L87 Difference]: Start difference. First operand 481 states and 740 transitions. Second operand 6 states. [2019-09-10 06:50:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:35,643 INFO L93 Difference]: Finished difference Result 2281 states and 3560 transitions. [2019-09-10 06:50:35,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:50:35,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:50:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:35,659 INFO L225 Difference]: With dead ends: 2281 [2019-09-10 06:50:35,660 INFO L226 Difference]: Without dead ends: 2281 [2019-09-10 06:50:35,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:50:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2019-09-10 06:50:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 929. [2019-09-10 06:50:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-10 06:50:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1432 transitions. [2019-09-10 06:50:35,716 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1432 transitions. Word has length 56 [2019-09-10 06:50:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:35,717 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1432 transitions. [2019-09-10 06:50:35,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:50:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1432 transitions. [2019-09-10 06:50:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:50:35,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:35,720 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] [2019-09-10 06:50:35,721 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:35,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:35,721 INFO L82 PathProgramCache]: Analyzing trace with hash -370124845, now seen corresponding path program 1 times [2019-09-10 06:50:35,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:35,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:35,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:35,872 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:50:35,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:35,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:50:35,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:35,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:50:35,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:50:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:50:35,874 INFO L87 Difference]: Start difference. First operand 929 states and 1432 transitions. Second operand 6 states. [2019-09-10 06:50:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:36,043 INFO L93 Difference]: Finished difference Result 3135 states and 4819 transitions. [2019-09-10 06:50:36,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:50:36,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:50:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:36,060 INFO L225 Difference]: With dead ends: 3135 [2019-09-10 06:50:36,060 INFO L226 Difference]: Without dead ends: 3135 [2019-09-10 06:50:36,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:50:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2019-09-10 06:50:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 3129. [2019-09-10 06:50:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-09-10 06:50:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4816 transitions. [2019-09-10 06:50:36,141 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4816 transitions. Word has length 57 [2019-09-10 06:50:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:36,142 INFO L475 AbstractCegarLoop]: Abstraction has 3129 states and 4816 transitions. [2019-09-10 06:50:36,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:50:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4816 transitions. [2019-09-10 06:50:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:50:36,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:36,144 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] [2019-09-10 06:50:36,144 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:36,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:36,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1007315784, now seen corresponding path program 1 times [2019-09-10 06:50:36,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:36,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:36,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:36,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:36,201 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:50:36,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:36,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:36,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:36,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:36,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:36,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:36,204 INFO L87 Difference]: Start difference. First operand 3129 states and 4816 transitions. Second operand 3 states. [2019-09-10 06:50:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:36,253 INFO L93 Difference]: Finished difference Result 5155 states and 7809 transitions. [2019-09-10 06:50:36,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:36,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 06:50:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:36,281 INFO L225 Difference]: With dead ends: 5155 [2019-09-10 06:50:36,281 INFO L226 Difference]: Without dead ends: 5155 [2019-09-10 06:50:36,282 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:50:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2019-09-10 06:50:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 5153. [2019-09-10 06:50:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2019-09-10 06:50:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 7808 transitions. [2019-09-10 06:50:36,439 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 7808 transitions. Word has length 58 [2019-09-10 06:50:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:36,440 INFO L475 AbstractCegarLoop]: Abstraction has 5153 states and 7808 transitions. [2019-09-10 06:50:36,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 7808 transitions. [2019-09-10 06:50:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:50:36,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:36,450 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] [2019-09-10 06:50:36,452 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:36,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1404763850, now seen corresponding path program 1 times [2019-09-10 06:50:36,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:36,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:36,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:36,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:36,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:36,591 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:50:36,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:36,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:50:36,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:36,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:50:36,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:50:36,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:50:36,594 INFO L87 Difference]: Start difference. First operand 5153 states and 7808 transitions. Second operand 5 states. [2019-09-10 06:50:36,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:36,965 INFO L93 Difference]: Finished difference Result 10275 states and 15473 transitions. [2019-09-10 06:50:36,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:50:36,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 06:50:36,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:37,016 INFO L225 Difference]: With dead ends: 10275 [2019-09-10 06:50:37,016 INFO L226 Difference]: Without dead ends: 10275 [2019-09-10 06:50:37,018 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:50:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10275 states. [2019-09-10 06:50:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10275 to 10273. [2019-09-10 06:50:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10273 states. [2019-09-10 06:50:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10273 states to 10273 states and 15472 transitions. [2019-09-10 06:50:37,260 INFO L78 Accepts]: Start accepts. Automaton has 10273 states and 15472 transitions. Word has length 59 [2019-09-10 06:50:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:37,262 INFO L475 AbstractCegarLoop]: Abstraction has 10273 states and 15472 transitions. [2019-09-10 06:50:37,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:50:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 10273 states and 15472 transitions. [2019-09-10 06:50:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:50:37,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:37,264 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] [2019-09-10 06:50:37,264 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:37,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:37,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1120231739, now seen corresponding path program 1 times [2019-09-10 06:50:37,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:37,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:37,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:37,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:37,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:37,370 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:50:37,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:37,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:50:37,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:37,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:50:37,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:50:37,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:50:37,372 INFO L87 Difference]: Start difference. First operand 10273 states and 15472 transitions. Second operand 5 states. [2019-09-10 06:50:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:37,487 INFO L93 Difference]: Finished difference Result 21025 states and 31168 transitions. [2019-09-10 06:50:37,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:50:37,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 06:50:37,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:37,637 INFO L225 Difference]: With dead ends: 21025 [2019-09-10 06:50:37,637 INFO L226 Difference]: Without dead ends: 21025 [2019-09-10 06:50:37,637 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:50:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21025 states. [2019-09-10 06:50:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21025 to 10785. [2019-09-10 06:50:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10785 states. [2019-09-10 06:50:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10785 states to 10785 states and 15984 transitions. [2019-09-10 06:50:37,920 INFO L78 Accepts]: Start accepts. Automaton has 10785 states and 15984 transitions. Word has length 59 [2019-09-10 06:50:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:37,920 INFO L475 AbstractCegarLoop]: Abstraction has 10785 states and 15984 transitions. [2019-09-10 06:50:37,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:50:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 10785 states and 15984 transitions. [2019-09-10 06:50:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:50:37,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:37,922 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:50:37,922 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:37,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:37,923 INFO L82 PathProgramCache]: Analyzing trace with hash -357825804, now seen corresponding path program 1 times [2019-09-10 06:50:37,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:37,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:37,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:37,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:37,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:38,008 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:50:38,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:38,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:38,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:38,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:38,010 INFO L87 Difference]: Start difference. First operand 10785 states and 15984 transitions. Second operand 3 states. [2019-09-10 06:50:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:38,074 INFO L93 Difference]: Finished difference Result 13261 states and 19463 transitions. [2019-09-10 06:50:38,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:38,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:50:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:38,106 INFO L225 Difference]: With dead ends: 13261 [2019-09-10 06:50:38,106 INFO L226 Difference]: Without dead ends: 13261 [2019-09-10 06:50:38,107 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:50:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13261 states. [2019-09-10 06:50:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13261 to 13203. [2019-09-10 06:50:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13203 states. [2019-09-10 06:50:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13203 states to 13203 states and 19406 transitions. [2019-09-10 06:50:38,451 INFO L78 Accepts]: Start accepts. Automaton has 13203 states and 19406 transitions. Word has length 60 [2019-09-10 06:50:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:38,452 INFO L475 AbstractCegarLoop]: Abstraction has 13203 states and 19406 transitions. [2019-09-10 06:50:38,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 13203 states and 19406 transitions. [2019-09-10 06:50:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:50:38,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:38,460 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] [2019-09-10 06:50:38,460 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:38,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:38,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1589729241, now seen corresponding path program 1 times [2019-09-10 06:50:38,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:38,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:38,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:38,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:38,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:38,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:38,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:50:38,713 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 06:50:38,717 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [77], [80], [85], [96], [98], [101], [112], [114], [117], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [162], [167], [180], [182], [195], [203], [222], [233], [235], [248], [256], [275], [286], [288], [301], [309], [328], [339], [341], [343], [346], [349], [352], [354], [356], [411], [412], [416], [417], [418] [2019-09-10 06:50:38,765 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:50:38,765 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:50:38,932 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:50:39,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:50:39,490 INFO L272 AbstractInterpreter]: Visited 76 different actions 429 times. Merged at 45 different actions 308 times. Widened at 14 different actions 28 times. Performed 1381 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1381 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 49 fixpoints after 11 different actions. Largest state had 118 variables. [2019-09-10 06:50:39,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:39,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:50:39,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:39,498 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:50:39,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:39,520 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:50:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:39,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:50:39,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:50:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:50:39,922 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:50:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-10 06:50:40,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:50:40,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 06:50:40,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:50:40,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:50:40,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:50:40,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:50:40,034 INFO L87 Difference]: Start difference. First operand 13203 states and 19406 transitions. Second operand 12 states. [2019-09-10 06:50:47,638 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-10 06:50:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:48,747 INFO L93 Difference]: Finished difference Result 150353 states and 214747 transitions. [2019-09-10 06:50:48,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 06:50:48,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-09-10 06:50:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:49,212 INFO L225 Difference]: With dead ends: 150353 [2019-09-10 06:50:49,213 INFO L226 Difference]: Without dead ends: 150353 [2019-09-10 06:50:49,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3728 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1763, Invalid=8137, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 06:50:49,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150353 states. [2019-09-10 06:50:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150353 to 38583. [2019-09-10 06:50:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38583 states. [2019-09-10 06:50:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38583 states to 38583 states and 55550 transitions. [2019-09-10 06:50:52,455 INFO L78 Accepts]: Start accepts. Automaton has 38583 states and 55550 transitions. Word has length 83 [2019-09-10 06:50:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:52,455 INFO L475 AbstractCegarLoop]: Abstraction has 38583 states and 55550 transitions. [2019-09-10 06:50:52,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:50:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 38583 states and 55550 transitions. [2019-09-10 06:50:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:50:52,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:52,469 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] [2019-09-10 06:50:52,469 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:52,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:52,470 INFO L82 PathProgramCache]: Analyzing trace with hash 972468303, now seen corresponding path program 1 times [2019-09-10 06:50:52,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:52,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:52,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:52,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:52,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:52,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:52,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:52,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:52,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:52,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:52,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:52,534 INFO L87 Difference]: Start difference. First operand 38583 states and 55550 transitions. Second operand 3 states. [2019-09-10 06:50:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:52,697 INFO L93 Difference]: Finished difference Result 59346 states and 84993 transitions. [2019-09-10 06:50:52,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:52,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 06:50:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:52,820 INFO L225 Difference]: With dead ends: 59346 [2019-09-10 06:50:52,821 INFO L226 Difference]: Without dead ends: 59346 [2019-09-10 06:50:52,821 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:50:52,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59346 states. [2019-09-10 06:50:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59346 to 59344. [2019-09-10 06:50:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59344 states. [2019-09-10 06:50:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59344 states to 59344 states and 84992 transitions. [2019-09-10 06:50:53,912 INFO L78 Accepts]: Start accepts. Automaton has 59344 states and 84992 transitions. Word has length 83 [2019-09-10 06:50:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:53,912 INFO L475 AbstractCegarLoop]: Abstraction has 59344 states and 84992 transitions. [2019-09-10 06:50:53,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 59344 states and 84992 transitions. [2019-09-10 06:50:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:50:53,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:53,926 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:50:53,927 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:53,927 INFO L82 PathProgramCache]: Analyzing trace with hash -256954202, now seen corresponding path program 1 times [2019-09-10 06:50:53,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:53,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:53,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:53,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:53,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:50:54,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:54,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:50:54,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:54,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:50:54,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:50:54,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:50:54,014 INFO L87 Difference]: Start difference. First operand 59344 states and 84992 transitions. Second operand 6 states. [2019-09-10 06:50:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:54,561 INFO L93 Difference]: Finished difference Result 166932 states and 236594 transitions. [2019-09-10 06:50:54,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:50:54,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-10 06:50:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:56,580 INFO L225 Difference]: With dead ends: 166932 [2019-09-10 06:50:56,580 INFO L226 Difference]: Without dead ends: 166932 [2019-09-10 06:50:56,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:50:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166932 states. [2019-09-10 06:50:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166932 to 166928. [2019-09-10 06:50:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166928 states. [2019-09-10 06:50:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166928 states to 166928 states and 236592 transitions. [2019-09-10 06:50:58,426 INFO L78 Accepts]: Start accepts. Automaton has 166928 states and 236592 transitions. Word has length 83 [2019-09-10 06:50:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:58,427 INFO L475 AbstractCegarLoop]: Abstraction has 166928 states and 236592 transitions. [2019-09-10 06:50:58,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:50:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 166928 states and 236592 transitions. [2019-09-10 06:50:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:50:58,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:58,450 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:50:58,450 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:58,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:58,450 INFO L82 PathProgramCache]: Analyzing trace with hash -526229301, now seen corresponding path program 1 times [2019-09-10 06:50:58,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:58,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:58,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:58,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:58,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:58,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:58,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:50:58,545 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 06:50:58,545 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [77], [98], [101], [104], [107], [112], [114], [117], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [195], [203], [222], [233], [235], [248], [256], [275], [277], [280], [288], [291], [294], [297], [299], [301], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 06:50:58,549 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:50:58,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:50:58,572 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:50:58,649 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:50:58,649 INFO L272 AbstractInterpreter]: Visited 68 different actions 152 times. Merged at 34 different actions 69 times. Widened at 2 different actions 2 times. Performed 628 root evaluator evaluations with a maximum evaluation depth of 5. Performed 628 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 3 different actions. Largest state had 118 variables. [2019-09-10 06:50:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:58,650 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:50:58,859 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 80.35% of their original sizes. [2019-09-10 06:50:58,859 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:51:01,326 INFO L420 sIntCurrentIteration]: We unified 82 AI predicates to 82 [2019-09-10 06:51:01,327 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:51:01,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:51:01,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [7] total 48 [2019-09-10 06:51:01,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:01,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 06:51:01,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 06:51:01,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1584, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:51:01,330 INFO L87 Difference]: Start difference. First operand 166928 states and 236592 transitions. Second operand 43 states. [2019-09-10 06:52:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:03,049 INFO L93 Difference]: Finished difference Result 396937 states and 552343 transitions. [2019-09-10 06:52:03,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 372 states. [2019-09-10 06:52:03,049 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-09-10 06:52:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:03,566 INFO L225 Difference]: With dead ends: 396937 [2019-09-10 06:52:03,567 INFO L226 Difference]: Without dead ends: 396937 [2019-09-10 06:52:03,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67896 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=16568, Invalid=132042, Unknown=0, NotChecked=0, Total=148610 [2019-09-10 06:52:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396937 states. [2019-09-10 06:52:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396937 to 210680. [2019-09-10 06:52:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210680 states. [2019-09-10 06:52:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210680 states to 210680 states and 296366 transitions. [2019-09-10 06:52:07,960 INFO L78 Accepts]: Start accepts. Automaton has 210680 states and 296366 transitions. Word has length 83 [2019-09-10 06:52:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:07,961 INFO L475 AbstractCegarLoop]: Abstraction has 210680 states and 296366 transitions. [2019-09-10 06:52:07,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 06:52:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 210680 states and 296366 transitions. [2019-09-10 06:52:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:52:07,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:07,983 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:52:07,983 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:07,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:07,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1752895755, now seen corresponding path program 1 times [2019-09-10 06:52:07,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:07,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:07,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:07,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:07,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:08,045 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:52:08,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:08,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:52:08,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:08,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:52:08,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:52:08,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:08,048 INFO L87 Difference]: Start difference. First operand 210680 states and 296366 transitions. Second operand 3 states. [2019-09-10 06:52:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:08,961 INFO L93 Difference]: Finished difference Result 276333 states and 384114 transitions. [2019-09-10 06:52:08,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:52:08,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 06:52:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:09,484 INFO L225 Difference]: With dead ends: 276333 [2019-09-10 06:52:09,485 INFO L226 Difference]: Without dead ends: 276333 [2019-09-10 06:52:09,485 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:52:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276333 states. [2019-09-10 06:52:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276333 to 274783. [2019-09-10 06:52:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274783 states. [2019-09-10 06:52:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274783 states to 274783 states and 382565 transitions. [2019-09-10 06:52:17,639 INFO L78 Accepts]: Start accepts. Automaton has 274783 states and 382565 transitions. Word has length 83 [2019-09-10 06:52:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:17,639 INFO L475 AbstractCegarLoop]: Abstraction has 274783 states and 382565 transitions. [2019-09-10 06:52:17,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:52:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 274783 states and 382565 transitions. [2019-09-10 06:52:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:52:17,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:17,658 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:52:17,658 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:17,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:17,659 INFO L82 PathProgramCache]: Analyzing trace with hash 274444906, now seen corresponding path program 1 times [2019-09-10 06:52:17,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:17,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:17,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:17,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:17,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:17,717 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:52:17,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:17,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:52:17,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:17,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:52:17,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:52:17,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:17,719 INFO L87 Difference]: Start difference. First operand 274783 states and 382565 transitions. Second operand 3 states. [2019-09-10 06:52:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:18,883 INFO L93 Difference]: Finished difference Result 376210 states and 514054 transitions. [2019-09-10 06:52:18,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:52:18,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 06:52:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:19,476 INFO L225 Difference]: With dead ends: 376210 [2019-09-10 06:52:19,476 INFO L226 Difference]: Without dead ends: 376210 [2019-09-10 06:52:19,477 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:52:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376210 states. [2019-09-10 06:52:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376210 to 361999. [2019-09-10 06:52:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361999 states. [2019-09-10 06:52:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361999 states to 361999 states and 496495 transitions. [2019-09-10 06:52:28,850 INFO L78 Accepts]: Start accepts. Automaton has 361999 states and 496495 transitions. Word has length 83 [2019-09-10 06:52:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:28,850 INFO L475 AbstractCegarLoop]: Abstraction has 361999 states and 496495 transitions. [2019-09-10 06:52:28,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:52:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 361999 states and 496495 transitions. [2019-09-10 06:52:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:52:28,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:28,873 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:52:28,873 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:28,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:28,873 INFO L82 PathProgramCache]: Analyzing trace with hash -212390925, now seen corresponding path program 1 times [2019-09-10 06:52:28,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:28,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:28,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:28,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:28,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:28,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:28,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:52:28,967 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 06:52:28,968 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [77], [98], [101], [112], [114], [117], [128], [130], [133], [136], [139], [144], [146], [149], [152], [154], [157], [158], [160], [169], [171], [174], [182], [185], [188], [191], [193], [195], [233], [235], [248], [256], [275], [286], [288], [301], [309], [328], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 06:52:28,972 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:52:28,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:52:28,986 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:52:29,050 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:52:29,051 INFO L272 AbstractInterpreter]: Visited 68 different actions 169 times. Merged at 34 different actions 85 times. Never widened. Performed 619 root evaluator evaluations with a maximum evaluation depth of 5. Performed 619 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 3 different actions. Largest state had 118 variables. [2019-09-10 06:52:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:29,051 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:52:29,221 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 80.6% of their original sizes. [2019-09-10 06:52:29,221 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:52:32,363 INFO L420 sIntCurrentIteration]: We unified 82 AI predicates to 82 [2019-09-10 06:52:32,363 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:52:32,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:52:32,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [7] total 48 [2019-09-10 06:52:32,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:32,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 06:52:32,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 06:52:32,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1578, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:52:32,365 INFO L87 Difference]: Start difference. First operand 361999 states and 496495 transitions. Second operand 43 states. [2019-09-10 06:53:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:11,068 INFO L93 Difference]: Finished difference Result 671631 states and 914684 transitions. [2019-09-10 06:53:11,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2019-09-10 06:53:11,069 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-09-10 06:53:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:15,972 INFO L225 Difference]: With dead ends: 671631 [2019-09-10 06:53:15,972 INFO L226 Difference]: Without dead ends: 671631 [2019-09-10 06:53:15,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30834 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=8792, Invalid=62230, Unknown=0, NotChecked=0, Total=71022 [2019-09-10 06:53:16,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671631 states. [2019-09-10 06:53:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671631 to 381395. [2019-09-10 06:53:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381395 states. [2019-09-10 06:53:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381395 states to 381395 states and 521324 transitions. [2019-09-10 06:53:22,763 INFO L78 Accepts]: Start accepts. Automaton has 381395 states and 521324 transitions. Word has length 83 [2019-09-10 06:53:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:22,763 INFO L475 AbstractCegarLoop]: Abstraction has 381395 states and 521324 transitions. [2019-09-10 06:53:22,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 06:53:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 381395 states and 521324 transitions. [2019-09-10 06:53:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:53:22,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:22,785 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:53:22,785 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:22,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:22,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1701976494, now seen corresponding path program 1 times [2019-09-10 06:53:22,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:22,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:22,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:22,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:22,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:22,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:22,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:53:22,870 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 06:53:22,870 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [77], [98], [101], [112], [114], [117], [120], [123], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [195], [203], [222], [224], [227], [235], [238], [241], [244], [246], [248], [286], [288], [301], [309], [328], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 06:53:22,873 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:53:22,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:53:22,886 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:53:22,930 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:53:22,931 INFO L272 AbstractInterpreter]: Visited 68 different actions 161 times. Merged at 34 different actions 79 times. Never widened. Performed 624 root evaluator evaluations with a maximum evaluation depth of 5. Performed 624 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 3 different actions. Largest state had 118 variables. [2019-09-10 06:53:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:22,931 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:53:23,008 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 80.47% of their original sizes. [2019-09-10 06:53:23,008 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:53:24,852 INFO L420 sIntCurrentIteration]: We unified 82 AI predicates to 82 [2019-09-10 06:53:24,852 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:53:24,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:53:24,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [7] total 48 [2019-09-10 06:53:24,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:24,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 06:53:24,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 06:53:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1582, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:53:24,854 INFO L87 Difference]: Start difference. First operand 381395 states and 521324 transitions. Second operand 43 states. [2019-09-10 06:54:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:25,355 INFO L93 Difference]: Finished difference Result 751282 states and 1017320 transitions. [2019-09-10 06:54:25,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 346 states. [2019-09-10 06:54:25,355 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-09-10 06:54:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:26,478 INFO L225 Difference]: With dead ends: 751282 [2019-09-10 06:54:26,478 INFO L226 Difference]: Without dead ends: 751282 [2019-09-10 06:54:26,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57913 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=13555, Invalid=114967, Unknown=0, NotChecked=0, Total=128522 [2019-09-10 06:54:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751282 states. [2019-09-10 06:54:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751282 to 410138. [2019-09-10 06:54:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410138 states. [2019-09-10 06:54:46,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410138 states to 410138 states and 559422 transitions. [2019-09-10 06:54:46,347 INFO L78 Accepts]: Start accepts. Automaton has 410138 states and 559422 transitions. Word has length 83 [2019-09-10 06:54:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:46,348 INFO L475 AbstractCegarLoop]: Abstraction has 410138 states and 559422 transitions. [2019-09-10 06:54:46,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 06:54:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 410138 states and 559422 transitions. [2019-09-10 06:54:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:54:46,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:46,366 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:54:46,366 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:46,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:46,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1605418753, now seen corresponding path program 1 times [2019-09-10 06:54:46,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:46,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:46,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:46,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:46,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:46,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:46,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:46,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:46,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:46,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:46,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:46,418 INFO L87 Difference]: Start difference. First operand 410138 states and 559422 transitions. Second operand 3 states. [2019-09-10 06:54:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:47,573 INFO L93 Difference]: Finished difference Result 394840 states and 533979 transitions. [2019-09-10 06:54:47,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:47,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 06:54:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:48,099 INFO L225 Difference]: With dead ends: 394840 [2019-09-10 06:54:48,099 INFO L226 Difference]: Without dead ends: 394840 [2019-09-10 06:54:48,099 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:54:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394840 states. [2019-09-10 06:55:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394840 to 351530. [2019-09-10 06:55:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351530 states. [2019-09-10 06:55:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351530 states to 351530 states and 474901 transitions. [2019-09-10 06:55:01,141 INFO L78 Accepts]: Start accepts. Automaton has 351530 states and 474901 transitions. Word has length 84 [2019-09-10 06:55:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:01,142 INFO L475 AbstractCegarLoop]: Abstraction has 351530 states and 474901 transitions. [2019-09-10 06:55:01,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 351530 states and 474901 transitions. [2019-09-10 06:55:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:55:01,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:01,159 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:55:01,159 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:01,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:01,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1227683816, now seen corresponding path program 1 times [2019-09-10 06:55:01,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:01,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:01,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:01,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:01,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:01,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:01,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:01,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:01,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:01,219 INFO L87 Difference]: Start difference. First operand 351530 states and 474901 transitions. Second operand 3 states. [2019-09-10 06:55:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:03,306 INFO L93 Difference]: Finished difference Result 401343 states and 531935 transitions. [2019-09-10 06:55:03,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:03,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 06:55:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:03,945 INFO L225 Difference]: With dead ends: 401343 [2019-09-10 06:55:03,946 INFO L226 Difference]: Without dead ends: 355625 [2019-09-10 06:55:03,946 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:55:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355625 states. [2019-09-10 06:55:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355625 to 337977. [2019-09-10 06:55:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337977 states. [2019-09-10 06:55:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337977 states to 337977 states and 450149 transitions. [2019-09-10 06:55:13,202 INFO L78 Accepts]: Start accepts. Automaton has 337977 states and 450149 transitions. Word has length 84 [2019-09-10 06:55:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:13,203 INFO L475 AbstractCegarLoop]: Abstraction has 337977 states and 450149 transitions. [2019-09-10 06:55:13,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 337977 states and 450149 transitions. [2019-09-10 06:55:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 06:55:13,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:13,222 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:55:13,222 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash 993170858, now seen corresponding path program 1 times [2019-09-10 06:55:13,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:13,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:13,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:13,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:13,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:55:13,307 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2019-09-10 06:55:13,307 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [77], [80], [85], [88], [91], [96], [98], [114], [117], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [195], [203], [222], [233], [235], [248], [256], [275], [288], [301], [309], [328], [330], [333], [341], [343], [346], [349], [352], [354], [356], [411], [412], [416], [417], [418] [2019-09-10 06:55:13,309 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:55:13,310 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:55:13,321 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:55:13,364 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:55:13,365 INFO L272 AbstractInterpreter]: Visited 70 different actions 151 times. Merged at 36 different actions 67 times. Widened at 1 different actions 1 times. Performed 596 root evaluator evaluations with a maximum evaluation depth of 5. Performed 596 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 4 different actions. Largest state had 118 variables. [2019-09-10 06:55:13,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:13,365 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:55:13,455 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 80.53% of their original sizes. [2019-09-10 06:55:13,456 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:55:15,359 INFO L420 sIntCurrentIteration]: We unified 84 AI predicates to 84 [2019-09-10 06:55:15,360 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:55:15,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:55:15,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [7] total 48 [2019-09-10 06:55:15,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:15,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 06:55:15,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 06:55:15,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1583, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:55:15,361 INFO L87 Difference]: Start difference. First operand 337977 states and 450149 transitions. Second operand 43 states. [2019-09-10 06:56:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:18,257 INFO L93 Difference]: Finished difference Result 653728 states and 861126 transitions. [2019-09-10 06:56:18,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 457 states. [2019-09-10 06:56:18,257 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 85 [2019-09-10 06:56:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:19,050 INFO L225 Difference]: With dead ends: 653728 [2019-09-10 06:56:19,051 INFO L226 Difference]: Without dead ends: 653717 [2019-09-10 06:56:19,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102808 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=24459, Invalid=196911, Unknown=0, NotChecked=0, Total=221370 [2019-09-10 06:56:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653717 states. [2019-09-10 06:56:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653717 to 366442. [2019-09-10 06:56:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366442 states. [2019-09-10 06:56:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366442 states to 366442 states and 485254 transitions. [2019-09-10 06:56:27,315 INFO L78 Accepts]: Start accepts. Automaton has 366442 states and 485254 transitions. Word has length 85 [2019-09-10 06:56:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:27,316 INFO L475 AbstractCegarLoop]: Abstraction has 366442 states and 485254 transitions. [2019-09-10 06:56:27,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 06:56:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 366442 states and 485254 transitions. [2019-09-10 06:56:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 06:56:27,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:27,335 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:56:27,335 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:27,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:27,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1459433209, now seen corresponding path program 1 times [2019-09-10 06:56:27,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:27,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:27,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:27,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:27,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:27,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:56:27,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:56:27,413 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2019-09-10 06:56:27,413 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [77], [98], [101], [104], [107], [112], [114], [117], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [185], [188], [191], [193], [195], [233], [235], [248], [256], [275], [277], [280], [288], [291], [294], [297], [299], [301], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 06:56:27,418 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:56:27,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:56:27,429 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:56:27,510 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:56:27,510 INFO L272 AbstractInterpreter]: Visited 70 different actions 247 times. Merged at 36 different actions 154 times. Widened at 5 different actions 6 times. Performed 905 root evaluator evaluations with a maximum evaluation depth of 5. Performed 905 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 6 different actions. Largest state had 119 variables. [2019-09-10 06:56:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:27,511 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:56:27,662 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 80.45% of their original sizes. [2019-09-10 06:56:27,662 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:56:29,773 INFO L420 sIntCurrentIteration]: We unified 84 AI predicates to 84 [2019-09-10 06:56:29,774 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:56:29,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:56:29,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [7] total 50 [2019-09-10 06:56:29,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:29,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 06:56:29,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 06:56:29,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1741, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:56:29,775 INFO L87 Difference]: Start difference. First operand 366442 states and 485254 transitions. Second operand 45 states. [2019-09-10 06:57:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:27,342 INFO L93 Difference]: Finished difference Result 669852 states and 881580 transitions. [2019-09-10 06:57:27,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 422 states. [2019-09-10 06:57:27,342 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2019-09-10 06:57:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:28,812 INFO L225 Difference]: With dead ends: 669852 [2019-09-10 06:57:28,813 INFO L226 Difference]: Without dead ends: 669852 [2019-09-10 06:57:28,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87413 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=20117, Invalid=170415, Unknown=0, NotChecked=0, Total=190532 [2019-09-10 06:57:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669852 states. [2019-09-10 06:57:35,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669852 to 373463. [2019-09-10 06:57:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373463 states. [2019-09-10 06:57:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373463 states to 373463 states and 493878 transitions. [2019-09-10 06:57:43,721 INFO L78 Accepts]: Start accepts. Automaton has 373463 states and 493878 transitions. Word has length 85 [2019-09-10 06:57:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:43,721 INFO L475 AbstractCegarLoop]: Abstraction has 373463 states and 493878 transitions. [2019-09-10 06:57:43,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 06:57:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 373463 states and 493878 transitions. [2019-09-10 06:57:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 06:57:43,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:43,738 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:57:43,738 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:43,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:43,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1408002499, now seen corresponding path program 1 times [2019-09-10 06:57:43,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:43,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:43,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:43,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:43,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:43,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:43,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:57:43,832 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2019-09-10 06:57:43,832 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [77], [98], [101], [104], [107], [112], [114], [117], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [195], [203], [222], [233], [235], [238], [241], [244], [246], [248], [277], [280], [288], [291], [294], [297], [299], [301], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 06:57:43,834 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:57:43,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:57:43,845 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:57:43,938 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:57:43,939 INFO L272 AbstractInterpreter]: Visited 70 different actions 284 times. Merged at 36 different actions 186 times. Widened at 12 different actions 17 times. Performed 1001 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1001 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 14 fixpoints after 8 different actions. Largest state had 119 variables. [2019-09-10 06:57:43,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:43,939 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:57:44,019 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 80.89% of their original sizes. [2019-09-10 06:57:44,019 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:57:46,198 INFO L420 sIntCurrentIteration]: We unified 84 AI predicates to 84 [2019-09-10 06:57:46,199 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:57:46,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:57:46,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [7] total 50 [2019-09-10 06:57:46,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:46,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 06:57:46,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 06:57:46,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1726, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:57:46,200 INFO L87 Difference]: Start difference. First operand 373463 states and 493878 transitions. Second operand 45 states. [2019-09-10 06:58:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:41,157 INFO L93 Difference]: Finished difference Result 743444 states and 975080 transitions. [2019-09-10 06:58:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 323 states. [2019-09-10 06:58:41,157 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2019-09-10 06:58:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:42,008 INFO L225 Difference]: With dead ends: 743444 [2019-09-10 06:58:42,008 INFO L226 Difference]: Without dead ends: 743444 [2019-09-10 06:58:42,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50777 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=13490, Invalid=102450, Unknown=0, NotChecked=0, Total=115940 [2019-09-10 06:58:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743444 states. [2019-09-10 06:58:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743444 to 407028. [2019-09-10 06:58:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407028 states. [2019-09-10 06:59:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407028 states to 407028 states and 536964 transitions. [2019-09-10 06:59:00,385 INFO L78 Accepts]: Start accepts. Automaton has 407028 states and 536964 transitions. Word has length 85 [2019-09-10 06:59:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:00,386 INFO L475 AbstractCegarLoop]: Abstraction has 407028 states and 536964 transitions. [2019-09-10 06:59:00,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 06:59:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 407028 states and 536964 transitions. [2019-09-10 06:59:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 06:59:00,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:00,401 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:59:00,401 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:00,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1550128860, now seen corresponding path program 1 times [2019-09-10 06:59:00,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:00,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:00,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:00,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:00,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:00,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:00,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:59:00,488 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2019-09-10 06:59:00,488 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [77], [98], [101], [112], [114], [117], [120], [123], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [185], [188], [191], [193], [195], [224], [227], [235], [238], [241], [244], [246], [248], [286], [288], [301], [309], [328], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 06:59:00,489 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:59:00,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:59:00,502 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:59:00,602 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:59:00,603 INFO L272 AbstractInterpreter]: Visited 70 different actions 275 times. Merged at 36 different actions 179 times. Widened at 8 different actions 9 times. Performed 950 root evaluator evaluations with a maximum evaluation depth of 5. Performed 950 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 7 different actions. Largest state had 119 variables. [2019-09-10 06:59:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:00,604 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:59:00,722 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 80.56% of their original sizes. [2019-09-10 06:59:00,722 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:59:02,732 INFO L420 sIntCurrentIteration]: We unified 84 AI predicates to 84 [2019-09-10 06:59:02,733 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:59:02,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:59:02,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [7] total 50 [2019-09-10 06:59:02,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:02,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 06:59:02,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 06:59:02,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1743, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:59:02,734 INFO L87 Difference]: Start difference. First operand 407028 states and 536964 transitions. Second operand 45 states. [2019-09-10 06:59:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:57,840 INFO L93 Difference]: Finished difference Result 771500 states and 1010912 transitions. [2019-09-10 06:59:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 400 states. [2019-09-10 06:59:57,840 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2019-09-10 06:59:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:58,868 INFO L225 Difference]: With dead ends: 771500 [2019-09-10 06:59:58,869 INFO L226 Difference]: Without dead ends: 771500 [2019-09-10 06:59:58,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77520 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=16848, Invalid=154962, Unknown=0, NotChecked=0, Total=171810 [2019-09-10 06:59:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771500 states. [2019-09-10 07:00:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771500 to 428345. [2019-09-10 07:00:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428345 states. [2019-09-10 07:00:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428345 states to 428345 states and 564013 transitions. [2019-09-10 07:00:15,934 INFO L78 Accepts]: Start accepts. Automaton has 428345 states and 564013 transitions. Word has length 85 [2019-09-10 07:00:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:15,934 INFO L475 AbstractCegarLoop]: Abstraction has 428345 states and 564013 transitions. [2019-09-10 07:00:15,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 07:00:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 428345 states and 564013 transitions. [2019-09-10 07:00:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:00:15,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:15,947 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:00:15,947 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1491728894, now seen corresponding path program 1 times [2019-09-10 07:00:15,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:15,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:15,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 07:00:16,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:16,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:16,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:16,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:16,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:16,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:16,064 INFO L87 Difference]: Start difference. First operand 428345 states and 564013 transitions. Second operand 6 states. [2019-09-10 07:00:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:18,819 INFO L93 Difference]: Finished difference Result 652344 states and 869712 transitions. [2019-09-10 07:00:18,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:00:18,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-10 07:00:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:19,853 INFO L225 Difference]: With dead ends: 652344 [2019-09-10 07:00:19,853 INFO L226 Difference]: Without dead ends: 651711 [2019-09-10 07:00:19,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651711 states. [2019-09-10 07:00:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651711 to 536714. [2019-09-10 07:00:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536714 states. [2019-09-10 07:00:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536714 states to 536714 states and 709486 transitions. [2019-09-10 07:00:35,754 INFO L78 Accepts]: Start accepts. Automaton has 536714 states and 709486 transitions. Word has length 86 [2019-09-10 07:00:35,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:35,755 INFO L475 AbstractCegarLoop]: Abstraction has 536714 states and 709486 transitions. [2019-09-10 07:00:35,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 536714 states and 709486 transitions. [2019-09-10 07:00:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:00:35,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:35,775 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:00:35,775 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:35,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:35,775 INFO L82 PathProgramCache]: Analyzing trace with hash 657901357, now seen corresponding path program 1 times [2019-09-10 07:00:35,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:35,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:35,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:35,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:35,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:00:35,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:35,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:35,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:35,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:35,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:35,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:35,812 INFO L87 Difference]: Start difference. First operand 536714 states and 709486 transitions. Second operand 3 states. [2019-09-10 07:00:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:43,286 INFO L93 Difference]: Finished difference Result 502758 states and 663499 transitions. [2019-09-10 07:00:43,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:43,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:00:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:44,053 INFO L225 Difference]: With dead ends: 502758 [2019-09-10 07:00:44,054 INFO L226 Difference]: Without dead ends: 502758 [2019-09-10 07:00:44,054 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 07:00:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502758 states. [2019-09-10 07:00:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502758 to 500689. [2019-09-10 07:00:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500689 states. [2019-09-10 07:00:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500689 states to 500689 states and 660994 transitions. [2019-09-10 07:00:50,895 INFO L78 Accepts]: Start accepts. Automaton has 500689 states and 660994 transitions. Word has length 86 [2019-09-10 07:00:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:50,895 INFO L475 AbstractCegarLoop]: Abstraction has 500689 states and 660994 transitions. [2019-09-10 07:00:50,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 500689 states and 660994 transitions. [2019-09-10 07:00:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:00:50,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:50,911 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:00:50,912 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1248252319, now seen corresponding path program 1 times [2019-09-10 07:00:50,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:50,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:50,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:50,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:50,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:00:50,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:50,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:50,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:50,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:50,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:50,985 INFO L87 Difference]: Start difference. First operand 500689 states and 660994 transitions. Second operand 6 states. [2019-09-10 07:00:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:57,929 INFO L93 Difference]: Finished difference Result 716741 states and 955905 transitions. [2019-09-10 07:00:57,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:00:57,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-10 07:00:57,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:00,157 INFO L225 Difference]: With dead ends: 716741 [2019-09-10 07:01:00,158 INFO L226 Difference]: Without dead ends: 716728 [2019-09-10 07:01:00,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716728 states. [2019-09-10 07:01:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716728 to 582979. [2019-09-10 07:01:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582979 states. [2019-09-10 07:01:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582979 states to 582979 states and 772088 transitions. [2019-09-10 07:01:19,697 INFO L78 Accepts]: Start accepts. Automaton has 582979 states and 772088 transitions. Word has length 86 [2019-09-10 07:01:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:19,697 INFO L475 AbstractCegarLoop]: Abstraction has 582979 states and 772088 transitions. [2019-09-10 07:01:19,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 582979 states and 772088 transitions. [2019-09-10 07:01:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:01:19,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:19,712 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:01:19,712 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1639993174, now seen corresponding path program 1 times [2019-09-10 07:01:19,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:19,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:19,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:19,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:19,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:01:19,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:19,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:19,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:19,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:19,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:19,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:19,797 INFO L87 Difference]: Start difference. First operand 582979 states and 772088 transitions. Second operand 6 states. [2019-09-10 07:01:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:23,515 INFO L93 Difference]: Finished difference Result 785016 states and 1047564 transitions. [2019-09-10 07:01:23,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:01:23,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-10 07:01:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:24,758 INFO L225 Difference]: With dead ends: 785016 [2019-09-10 07:01:24,758 INFO L226 Difference]: Without dead ends: 785016 [2019-09-10 07:01:24,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785016 states. [2019-09-10 07:01:40,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785016 to 651267. [2019-09-10 07:01:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651267 states. [2019-09-10 07:01:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651267 states to 651267 states and 864022 transitions. [2019-09-10 07:01:41,626 INFO L78 Accepts]: Start accepts. Automaton has 651267 states and 864022 transitions. Word has length 86 [2019-09-10 07:01:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:41,627 INFO L475 AbstractCegarLoop]: Abstraction has 651267 states and 864022 transitions. [2019-09-10 07:01:41,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 651267 states and 864022 transitions. [2019-09-10 07:01:41,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:01:41,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:41,646 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] [2019-09-10 07:01:41,646 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:41,646 INFO L82 PathProgramCache]: Analyzing trace with hash 738156312, now seen corresponding path program 1 times [2019-09-10 07:01:41,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:41,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:41,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:41,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:41,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:41,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:41,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:41,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:41,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:41,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:41,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:41,692 INFO L87 Difference]: Start difference. First operand 651267 states and 864022 transitions. Second operand 3 states.